Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
Designs, Codes and Cryptography
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
On the linear complexity of bounded integer sequences over different moduli
Information Processing Letters
One-error linear complexity over Fp of Sidelnikov sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Linear complexity over Fp of ternary Sidel’nikov sequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Addendum to Sidel'nikov sequences over nonprime fields
Information Processing Letters
| Hi-index | 754.84 |
Helleseth, Kim, and No (2003) described the linear complexity over Fp of Sidel'nikov sequences of length pm-1 for p=3, 5, and 7. In this correspondence, the result is generalized to all odd primes.