Some algorithms for the error linear complexity of binary 2 n -periodic sequences

Abstract

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… (More)
DOI: 10.1007/s11859-013-0891-2

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.