DocumentCode :
1014382
Title :
On the lower bound of the linear complexity over Fp of Sidelnikov sequences
Author :
Garaev, Moubariz Z. ; Luca, Florian ; Shparlinski, Igor E. ; Winterhof, Arne
Author_Institution :
Instituto de Matematicas, Univ. Nacional Autonoma de Mexico, Michoacan, Mexico
Volume :
52
Issue :
7
fYear :
2006
fDate :
7/1/2006 12:00:00 AM
Firstpage :
3299
Lastpage :
3304
Abstract :
For a Sidelnikov sequence of period pm-1, tight lower bounds are obtained on its linear complexity L over Fp. In particular, these bounds imply that, uniformly over all p and m, L is close to its largest possible value pm-1.
Keywords :
computational complexity; sequences; Sidelnikov sequences; linear complexity; lower bound; Boolean functions; Codes; Computer science; Cryptography; Galois fields; Iterative methods; Polynomials; Signal design; Sufficient conditions; Wireless communication; Character sums; Sidelnikov sequences; linear complexity;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2006.876352
Filename :
1650373
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1014382
بازگشت