Sequences and Their Applications – SETA 2006

Volume 4086 of the series Lecture Notes in Computer Science pp 47-60

On the Linear Complexity of Sidel’nikov Sequences over \({\mathbb {F}}_d\)

  • Nina BrandstätterAffiliated withJohann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences
  • , Wilfried MeidlAffiliated withSabanci University

* Final gross prices may vary according to local VAT.

Get Access


We study the linear complexity of sequences over the prime field \({\mathbb{F}_d}\) 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.


Sidel’nikov sequence Linear complexity Linear complexity profile Aperiodic autocorrelation