𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Base sequences, complementary ternary sequences, and orthogonal designs

✍ Scribed by Dragomir Ž. Doković

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
535 KB
Volume
4
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

We construct several new families of orthogonal designs related to one of the weighing matrix conjectures. We also construct some new complementary quadruples (A; B; C; D ) of (0, fi}sequences of length n and total weight w, denoted as CTQ(n, w). The word complementary refers to the fact that the sum of nonperiodic autocorrelation functions of these four sequences is a delta function. W e propose a conjectural formula for n(w), the smallest positive integer n such that CTQ(n, U ) exist, and survey the known results for all w 5 100. We also exhibit the first example of base sequences BS(32,31).

📜 SIMILAR VOLUMES

On Sequences with Zero Autocorrelation a
On Sequences with Zero Autocorrelation and Orthogonal Designs
✍ S. Georgiou; C. Koukouvinos 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 145 KB

We propose some methods for multiplying the length and type of sequences with elements on a set of commuting variables which have zero non-periodic autocorrelation function. We use base sequences of lengths n+1, n+1, n, n in order to construct four directed sequences of lengths n+1, n+1, n, n and ty

Chain Sequences, Orthogonal Polynomials,
Chain Sequences, Orthogonal Polynomials, and Jacobi Matrices
✍ Ryszard Szwarc 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 337 KB

Chain sequences are positive sequences [a n ] of the form a n = g n (1& g n&1 ) for a nonnegative sequence [g n ]. This concept was introduced by Wall in connection with continued fractions. In his monograph on orthogonal polynomials, Chihara conjectured that if a n 1 4 for each n then (a n & 1 4 )

Orthogonal Arrays, Primitive Trinomials,
Orthogonal Arrays, Primitive Trinomials, and Shift-Register Sequences
✍ Akihiro Munemasa 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 271 KB

We investigate properties of maximum-length binary shift-register sequences defined by primitive trinomials. We consider the set of subintervals of length n of such a sequence for m(n42m#1, where m is the degree of the trinomial. This set is an orthogonal array of strength 2 and is shown to have a p