On the Error Linear Complexity Spectrum of Binary Sequences with Period of Power of Two

The properties of error linear complexity of binary sequences with period of power of two are studied in this paper. Using the Games-Chan algorithm as main tool, accurate formulas of the minimum value k for which the k-error linear complexity is strictly less than the first and second critical error...

Full description

Saved in:
Bibliographic Details
Published in:Chinese Journal of Electronics 2015-04, Vol.24 (2), p.366-372
Main Authors: Chang, Zuling, Ke, Pinhui
Format: Article
Language:English
Subjects:
algorithm
Binary
binary sequences
complexity
computational complexity
critical error linear complexity
Error
error analysis
Games-Chan
Games‐Chan algorithm
k‐error linear complexity spectrum
linear
sequences
Spectrum
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The properties of error linear complexity of binary sequences with period of power of two are studied in this paper. Using the Games-Chan algorithm as main tool, accurate formulas of the minimum value k for which the k-error linear complexity is strictly less than the first and second critical error linear complexity are provided respectively.
ISSN:1022-4653
2075-5597
DOI:10.1049/cje.2015.04.024