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 2n-periodic se- quences. These new algorithms are clearer and simpler than old algorithms, and they can quickly compute the error linear com-...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Wuhan University journal of natural sciences 2013-02, Vol.18 (1), p.42-48
Hauptverfasser: Chang, Zuling, Wang, Xueyuan, Duan, Li
Format: Artikel
Sprache:eng
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Based on the Games-Chan algorithm and StampMartin algorithm, this paper provides some new algorithms to compute the error linear complexity spectrum of binary 2n-periodic se- quences. These new algorithms are clearer and simpler than old algorithms, and they can quickly compute the error linear com- plexity 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.
ISSN:1007-1202
1993-4998
DOI:10.1007/s11859-013-0891-2