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
fDate :
5/1/1998 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
