Aly, Hassan and Marzouk, Radwa and Meidl, Wilfried (2010) On the calculation of the linear complexity of periodic sequences. In: 9th International Conference on Finite Fields and Their Applications, Dublin, Ireland
This is the latest version of this item.
PDF
Fq09Meidl.pdf
Download (211kB)
Fq09Meidl.pdf
Download (211kB)
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:  Q Science > QA Mathematics > QA150272.5 Algebra 
Divisions:  Faculty of Engineering and Natural Sciences > Basic Sciences > Mathematics Faculty of Engineering and Natural Sciences 
Depositing User:  Wilfried Meidl 
Date Deposited:  25 Oct 2010 12:39 
Last Modified:  26 Apr 2022 08:57 
URI:  https://research.sabanciuniv.edu/id/eprint/14867 
Available Versions of this Item

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