On the calculation of the linear complexity of periodic sequences

被引：0
|
作者：
Aly, Hassan [1 ]
Marzouk, Radwa
Meidl, Wilfried
机构：
[1] Cairo Univ, Fac Sci, Dept Math, Giza 12632, Egypt
来源：
FINITE FIELDS: THEORY AND APPLICATIONS | 2010年 / 518卷
关键词：
DISCRETE FOURIER-TRANSFORM; FAST ALGORITHMS;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：11 / +
页数：3
相关论文
共 50 条
12345