On the linear complexity of Sidel'nikov Sequences over Fd

Official URL: http://www.springerlink.com/content/y3x17650xn111p95/?p=2e5fd40f13fa445d8a27333cc0435aa5&pi=3

We study the linear complexity of sequences over the prime field Fd introduced by Sidel’nikov. For several classes of period length we can show that these sequences have a large linear complexity. For the ternary case we present exact results on the linear complexity using well known results on cyclotomic numbers. Moreover, we prove a general lower bound on the linear complexity profile for all of these sequences. The obtained results extend known results on the binary case. Finally we present an upper bound on the aperiodic autocorrelation.