On the lower bound of the linear complexity over Fp of Sidelnikov sequences

Authors:
M. Z. Garaev;F. Luca;I. E. Shparlinski;A. Winterhof
Affiliations:
Instituto de Matematicas, Univ. Nacional Autonoma de Mexico, Michoacan, Mexico;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

On the linear complexity of bounded integer sequences over different moduli

Information Processing Letters
On the k-error linear complexity over $$\mathbb{F}_p$$ of Legendre and Sidelnikov sequences

Designs, Codes and Cryptography
On the linear complexity of Sidel'nikov sequences over nonprime fields

Journal of Complexity
Addendum to Sidel'nikov sequences over nonprime fields

Information Processing Letters

Quantified Score

Hi-index	754.84

Visualization

Abstract

For a Sidelnikov sequence of period pm-1, tight lower bounds are obtained on its linear complexity L over Fp. In particular, these bounds imply that, uniformly over all p and m, L is close to its largest possible value pm-1.