DocumentCode
1367584
Title
On the linear complexity of Legendre sequences
Author
Ding, Cunsheng ; Hesseseth, T. ; Shan, Weijuan
Author_Institution
Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore, Singapore
Volume
44
Issue
3
fYear
1998
fDate
5/1/1998 12:00:00 AM
Firstpage
1276
Lastpage
1278
Abstract
We determine the linear complexity of all Legendre sequences and the (monic) feedback polynomial of the shortest linear feedback shift register that generates such a Legendre sequence. The result shows that Legendre sequences are quite good from the linear complexity viewpoint
Keywords
Galois fields; Legendre polynomials; binary sequences; computational complexity; Galois fields; Legendre sequences; binary sequences; feedback polynomial; linear complexity; linear feedback shift register; Binary sequences; Computer science; Cryptography; Encyclopedias; Galois fields; Linear feedback shift registers; Mathematics; Polynomials;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.669398
Filename
669398
Link To Document