On the linear complexity of bounded integer sequences over different moduli
References (12)
- et al.
On the linear complexity profile of some new explicit nonlinear pseudorandom number generators
J. Complexity
(2004) - et al.
Stream Ciphers and Number Theory
(2003) - M. Garaev, F. Luca, I.E. Shparlinski, A. Winterhof, On the linear complexity over Fp of Sidelnikov sequences, Preprint,...
- et al.
Linear complexity over and trace representation of Lempel–Cohn–Eastman sequences
IEEE Trans. Inform. Theory
(2003) - et al.
Linear complexity over of Sidel'nikov sequences
IEEE Trans. Inform. Theory
(2004) - et al.
On binary sequences with period with optimal autocorrelation
There are more references available in the full text version of this article.
Cited by (6)
Addendum to Sidel'nikov sequences over nonprime fields
2013, Information Processing LettersExpanding Extremal Graphs and Implemented Solutions of Post Quantum Cryptography
2023, CEUR Workshop ProceedingsA new method to compute the 2-adic complexity of binary sequences
2014, IEEE Transactions on Information TheoryLINEAR COMPLEXITY AND RELATED COMPLEXITY MEASURES
2010, Selected Topics in Information and Coding TheoryLinear complexity of sequences under different interpretations
2006, IEICE Transactions on Fundamentals of Electronics, Communications and Computer SciencesOn the lower bound of the linear complexity over F<inf>p</inf> of Sidelnikov sequences
2006, IEEE Transactions on Information Theory
Copyright © 2005 Elsevier B.V. All rights reserved.