Some Notes on the Linear Complexity of Sidel’nikov-Lempel-Cohn-Eastman Sequences

This publication has 20 references indexed in Scilit:

• Linear Complexity Over$F_p$of Sidel'nikov Sequences
  IEEE Transactions on Information Theory, 2004
• Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
  IEEE Transactions on Information Theory, 2003
• Lower bounds on the linear complexity of the discrete logarithm in finite fields
  IEEE Transactions on Information Theory, 2001
• Generalised Sidelnikov sequences with optimal autocorrelationproperties
  Electronics Letters, 2000
• On the linear complexity of Legendre sequences
  IEEE Transactions on Information Theory, 1998
• On cyclotomic generator of order r
  Information Processing Letters, 1998
• Randomized algorithms in number theory
  Communications on Pure and Applied Mathematics, 1986
• A class of balanced binary sequences with optimal autocorrelation properties
  IEEE Transactions on Information Theory, 1977
• On the number of solutions ofu^k+D≡w²(modp)
  Pacific Journal of Mathematics, 1955
• Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik.
  Journal für die reine und angewandte Mathematik (Crelles Journal), 1936