On the calculation of the linear complexity of periodic sequences

Aly, Hassan and Marzouk, Radwa and Meidl, Wilfried (2009) On the calculation of the linear complexity of periodic sequences. In: 9th International Conference on Finite Fields and Their Applications, UCD, Dublin (Accepted/In Press)

There is a more recent version of this item available.

Preview

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
206Kb

Abstract

Based on a result of Hao Chen in 2006 we present a general procedure how to reduce the determination of the linear complexity of a sequence over a finite field $\F_q$ of period $un$ to the determination of the linear complexities of $u$ sequences over $\F_q$ of period $n$. We apply this procedure to some classes of periodic sequences over a finite field $\F_q$ obtaining efficient algorithms to determine the linear complexity.

Item Type:	Papers in Conference Proceedings
Subjects:	UNSPECIFIED
ID Code:	13153
Deposited By:	Wilfried Meidl
Deposited On:	02 Dec 2009 21:40
Last Modified:	25 Oct 2010 12:39

Available Versions of this Item

On the calculation of the linear complexity of periodic sequences. (deposited 02 Dec 2009 21:40) [Currently Displayed]
- On the calculation of the linear complexity of periodic sequences. (deposited 25 Oct 2010 12:39)

Repository Staff Only: item control page