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
Determining the complexity of FH/SS sequence by approximate entropy
IEEE Transactions on Communications
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 |
In this article, the linear complexity over Fp of Lempel-Cohn-Eastman (1977) sequences of period pm-1 for an odd prime p is determined. For p=3,5, and 7, the exact closed-form expressions for the linear complexity over Fp of LCE sequences of period pm-1 are derived. Further, the trace representations for LCE sequences of period pm-1 for p=3 and 5 are found by computing the values of all Fourier coefficients in Fp for the sequences.