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

Brandstatter, Nina and Meidl, Wilfried (2008) On the linear complexity of Sidel'nikov sequences over nonprime fields. Journal of complexity, 24 (5-6). pp. 648-659. ISSN 0885-064X

This is the latest version of this item.

PDF
NinaMeidl_2.pdf
Download (199kB)

Official URL: http://dx.doi.org/10.1016/j.jco.2008.04.002

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 F-8 we provide exact values for their linear complexity.

Item Type:	Article
Uncontrolled Keywords:	Sidel'nikov sequence; Linear complexity; Cyclotomic numbers; Sequences over finite fields
Divisions:	Faculty of Engineering and Natural Sciences
Depositing User:	Wilfried Meidl
Date Deposited:	29 Apr 2009 09:57
Last Modified:	26 Apr 2022 08:28
URI:	https://research.sabanciuniv.edu/id/eprint/11482

Available Versions of this Item

On the linear complexity of Sidel'nikov Sequences over nonprime fields. (deposited 04 Jun 2008 09:56)
- On the linear complexity of Sidel'nikov Sequences over nonprime fields. (deposited 07 Nov 2008 17:10)
  - On the linear complexity of Sidel'nikov sequences over nonprime fields. (deposited 29 Apr 2009 09:57) [Currently Displayed]

Actions (login required)

: View Item