On the linear complexity of Legendre sequences
Cunsheng Ding, T. Hesseseth, Weijuan Shan · IEEE Transactions on Information Theory · 1998
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.