Open AccessJournal Article
Linear Complexity and 1-Error Linear Complexity over $F_p$ of M-ary Sidel'nikov Sequences
Jin-Ho Chung,Kyeongcheol Yang +1 more
Reads0
Chats0
TLDR
The asymptotic behavior of the normalized linear complexity and the normalized 1-error linear complexity with respect to the period is presented.Abstract:
In this paper we derive some lower bounds on the linear complexity and upper bounds on the 1-error linear complexity over of M-ary Sidel'nikov sequences of period when and mod M. In particular, we exactly compute the 1-error linear complexity of ternary Sidel'nikov sequences when and . Based on these bounds we present the asymptotic behavior of the normalized linear complexity and the normalized 1-error linear complexity with respect to the period.read more
Citations
More filters
A Character Formula for the Sidelnikov-Lempel-Cohn-Eastman Sequences
TL;DR: In this article, a character formula expressing the character values of the almost difference sets associated with the Sidelnikov-Lempel-Cohn-Eastman (SLCE) sequences in terms of certain Jacobi sums was obtained.
References
More filters
A Character Formula for the Sidelnikov-Lempel-Cohn-Eastman Sequences
TL;DR: In this article, a character formula expressing the character values of the almost difference sets associated with the Sidelnikov-Lempel-Cohn-Eastman (SLCE) sequences in terms of certain Jacobi sums was obtained.
Related Papers (5)
Bounds on the linear complexity and the 1-error linear complexity over F p of M -ary Sidel'nikov sequences
Jin-Ho Chung,Kyeongcheol Yang +1 more
On the Linear Complexity and $k$ -Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$ -ary Sidel'nikov Sequence
Hassan Aly,Wilfried Meidl +1 more