On the linear complexity of Sidel'nikov sequences over nonprime fields

Abstract

We introduce a generalization of Sidel’nikov sequences for arbitrary finite fields. We show that several classes of Sidel’nikov sequences over arbitrary finite fields exhibit a large linear complexity. For Sidel’nikov sequences over F8 we provide exact values for their linear complexity. 
DOI: 10.1016/j.jco.2008.04.002

Topics

  • Presentations referencing similar topics