Abstract
The d-ary Sidel'nikov sequence S = s(0), s(1).. of period q - 1 for a prime power q = p(m) is a frequently analyzed sequence in the literature. Recently, it turned out that the linear complexity over F-p of the (d-ary Sidel'nikov sequence is considerably smaller than the period if the sequence element S (q - 1) /2mod (q - 1) is chosen adequately. In this paper this work is continued and tight lower bounds on the linear complexity over F, 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.