Trace Representation of Legendre Sequences
Designs, Codes and Cryptography
Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
How Many Bits have to be Changed to Decrease the Linear Complexity?
Designs, Codes and Cryptography
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
Designs, Codes and Cryptography
On the k-error linear complexity over $$\mathbb{F}_p$$ of Legendre and Sidelnikov sequences
Designs, Codes and Cryptography
Sequences related to Legendre/Jacobi sequences
Information Sciences: an International Journal
The linear complexity of new generalized cyclotomic binary sequences of order four
Information Sciences: an International Journal
Some notes on prime-square sequences
Journal of Computer Science and Technology
Linear complexity of ternary sequences formed on the basis of power residue classes
Problems of Information Transmission
Remarks on a cyclotomic sequence
Designs, Codes and Cryptography
New results on periodic sequences with large k-error linear complexity
IEEE Transactions on Information Theory
New M-ary sequence families with low correlation and large size
IEEE Transactions on Information Theory
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
On the autocorrelation and the linear complexity of q-ary prime n-square sequences
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
The linear complexity of binary sequences with optimal autocorrelation
IEEE Transactions on Information Theory
About computation of the linear complexity of generalized cyclotomic sequences with period pn+1
Designs, Codes and Cryptography
New sets of binary and ternary sequences with low correlation
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
A generalization of the Hall's sextic residue sequences
Information Sciences: an International Journal
Designs, Codes and Cryptography
Linear complexity of quaternary sequences of length pq with low autocorrelation
Journal of Computational and Applied Mathematics
| Hi-index | 755.02 |
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