title   
  

A general approach to construction and determination of the linear complexity of sequences based on cosets

Çeşmelioğlu, Ayça and Meidl, Wilfried (2010) A general approach to construction and determination of the linear complexity of sequences based on cosets. In: 6th International Conference on Sequences and Their Applications - SETA 2010, Paris, France

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
202Kb

Official URL: http://dx.doi.org/10.1007/978-3-642-15874-2_10

Abstract

We give a general approach to $N$-periodic sequences over a finite field $\F_q$ constructed via a subgroup $D$ of the group of invertible elements modulo $N$. Well known examples are Legendre sequences or the two-prime generator. For some generalizations of sequences considered in the literature and for some new examples of sequence constructions we determine the linear complexity.

Item Type:Papers in Conference Proceedings
Subjects:UNSPECIFIED
ID Code:14868
Deposited By:Wilfried Meidl
Deposited On:25 Oct 2010 12:29
Last Modified:11 Mar 2011 15:02

Repository Staff Only: item control page