On the Linear Complexity and k-Error Linear Complexity Over Fp of the d-ary Sidel'nikov Sequence.

The d-ary Sidel'nikov sequence S = s0, s1 … of period q - 1 for a prime power q = pm is a frequently analyzed sequence in the literature. Recently, it turned out that the linear complexity over Fp of the d-ary Sidel'nikov sequence is considerably smaller than the period if the sequence element s( q - 1) /2 mod (q - 1) is chosen adequately. In this paper this work is continued and tight lower bounds on the linear complexity over Fp of the d-ary Sidel'nikov sequence are given. For certain cases exact values are provided. Finally, results on the k-error linear complexity over Fp of the d-ary Sidel'nikov sequence are presented. [ABSTRACT FROM AUTHOR]