A trace representation of binary Jacobi sequences

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Power residues, reciprocity (11A15) Recurrences (11B37) Sequences (mod (m)) (11B50)

Review text

Binary \(\pm 1\) sequences \({\mathbf a}=(a_i)\) of period \(N\) with a two-level-autocorrelation function \(C_t(a)=\sum_{i=0}^{N-1} a_ia_{i+t}\) are equivalent to cyclic difference sets. If the autocorrelation coefficients \(t\neq 0\) are constant \(-1\), the sequences are called perfect, and the corresponding difference sets are Hadamard difference sets. A well-known construction is the twin prime construction, where \(N=p(p+2)\) is the product of two primes [see \textit{R. G. Stanton} and \textit{D. A. Sprott}, ``A family of difference sets, Can. J. Math. 10, 73--77 (1958; Zbl 0079.01104), for instance]. As an ingredient, one uses the Legendre sequences of prime length. This construction has been generalized in different directions, in the sequence community Jacobi sequences have been defined where \(N=pq\) is the product of distinct primes \(p\) and \(q\). The authors use the knowledge of the Fourier spectrum of the Legendre sequences in order to describe the Fourier spectrum of the Jacobi sequences. As a corollary, the linear complexity of the Jacobi sequences is obtained.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: A trace representation of binary Jacobi sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024461)