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 ...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.展开更多
基金Supported by the National Natural Science Foundation of China (61174085, 61170270, 61121061)
文摘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.
