Title :
Linear complexity over Fp of Sidel´nikov sequences
Author :
Helleseth, Tor ; Maas, Martijn ; Mathiassen, John Erik ; Segers, Toon
Author_Institution :
Dept. of Informatics, Univ. of Bergen, Norway
Abstract :
Helleseth, Kim, and No (2003) described the linear complexity over Fp of Sidel´nikov sequences of length pm-1 for p=3, 5, and 7. In this correspondence, the result is generalized to all odd primes.
Keywords :
Fourier transforms; binary sequences; computational complexity; correlation methods; linear codes; transform coding; Lempel-Cohn-Eastman sequence; Sidel´nikov sequence length; autocorrelation; linear complexity; Autocorrelation; Binary sequences; Closed-form solution; Communication systems; Councils; Discrete Fourier transforms; Fourier transforms; Genetic expression; Hamming weight; Multiaccess communication; Autocorrelation; Lempel–Cohn–Eastman; Sidel'nikov; linear complexity; sequence;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2004.834854
