Some Algorithms for the Error Linear Complexity of Binary 2(n)-Periodic Sequences

Based on the Games-Chan algorithm and StampMartin algorithm, this paper provides some new algorithms to compute the error linear complexity spectrum of binary 2(n)-periodic sequences. These new algorithms are clearer and simpler than old algorithms, and they can quickly compute the error linear comp...

Full description

Saved in:
Bibliographic Details
Published inWuhan University journal of natural sciences Vol. 18; no. 1; pp. 42 - 48
Main Authors Chang, Zuling, Wang, Xueyuan, Duan, Li
Format Journal Article
LanguageEnglish
Published 01.02.2013
Subjects
Algorithms
Complexity
Errors
Online AccessGet full text
ISSN1007-1202
DOI10.1007/s11859-013-0891-2

Cover

More Information
Summary:Based on the Games-Chan algorithm and StampMartin algorithm, this paper provides some new algorithms to compute the error linear complexity spectrum of binary 2(n)-periodic sequences. These new algorithms are clearer and simpler than old algorithms, and they can quickly compute the error linear complexity spectrum of sequences according to different situations. We also discuss such algorithms and give some new results about linear complexity and error linear complexity of sequences.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1007-1202
DOI:10.1007/s11859-013-0891-2