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

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.

• Type: Journal
• Year: 2008
• Where: JC
• Authors: Nina Brandstätter, Wilfried Meidl
• Keywords: Arbitrary Finite Fields, JC 2008, Linear Complexity, Sidel'nikov Sequences