On the linear complexity of bounded integer sequences over different moduli

Authors:
Igor E. Shparlinski;Arne Winterhof
Affiliations:
Department of Computing, Macquarie University, Sydney NSW, Australia;Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenberger Straße, Linz, Austria
Venue:
Information Processing Letters
Year:
2005

Citing 6
Cited 0

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
On the lower bound of the linear complexity over Fp of Sidelnikov sequences

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.