On the Linear Complexity of the Sidelnikov-Lempel-Cohn-Eastman Sequences
Designs, Codes and Cryptography
On the linear complexity profile of some new explicit inversive pseudorandom numbers
Journal of Complexity - Special issue on coding and cryptography
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
Designs, Codes and Cryptography
Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences
IEEE Transactions on Information Theory
Linear complexity over Fp of Sidel'nikov sequences
IEEE Transactions on Information Theory
Addendum to Sidel'nikov sequences over nonprime fields
Information Processing Letters
Hi-index | 0.89 |
We give a relation between the linear complexity over the integers and over the residue rings modulo m of a bounded integer sequence. This relation can be used to obtain a variety of new results for several sequences widely studied in the literature. In particular we apply it to Sidelnikov sequences.