DocumentCode :
2052804
Title :
Linear complexity over Fp of Sidel´nikov sequences
Author :
Helleseth, Tor ; Mathiassen, John Erik ; Maas, Martijn ; Segers, Toon
Author_Institution :
Dept. of Informatics., Bergen Univ., Norway
fYear :
2004
fDate :
27 June-2 July 2004
Firstpage :
122
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. This result is generalized to all odd primes.
Keywords :
binary sequences; computational complexity; random sequences; Sidel´nikov sequence; linear complexity; odd prime; Autocorrelation; Binary sequences; Closed-form solution; Fourier transforms; Galois fields; Genetic expression; Hamming weight; Informatics; Mathematics; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
Type :
conf
DOI :
10.1109/ISIT.2004.1365158
Filename :
1365158
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2052804
بازگشت