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

Meidl, Wilfried and Brandstaetter, Nina (2008) On the linear complexity of Sidel'nikov Sequences over nonprime fields. (Accepted/In Press)

There is a more recent version of this item available.

PDF
NinaMeidl_2.pdf
Download (199kB)

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
Divisions:	Faculty of Engineering and Natural Sciences
Depositing User:	Wilfried Meidl
Date Deposited:	04 Jun 2008 09:56
Last Modified:	19 Jul 2019 09:34
URI:	https://research.sabanciuniv.edu/id/eprint/8601

Available Versions of this Item

On the linear complexity of Sidel'nikov Sequences over nonprime fields. (deposited 04 Jun 2008 09:56) [Currently Displayed]
- 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)

Actions (login required)

: View Item