Design theory
Finite fields
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
On the linear complexity of Sidel'nikov sequences over Fd
SETA'06 Proceedings of the 4th 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
Addendum to Sidel'nikov sequences over nonprime fields
Information Processing Letters
| Hi-index | 0.00 |
In [6] and [10], a construction of binary sequences with an (almost) optimal autocorrelation spectrum is suggested. We continue the study of the linear complexity and the linear feedback polynomial of these sequences over \Bbb{F}2, originated in [4].