On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two

The linear Games-Chan algorithm for computing the linear complexity c(s) of a binary sequence s of period ℓ = 2n requires the knowledge of the full sequence, while the quadratic Berlekamp-Massey algorithm only requires knowledge of 2c(s) terms. We show that we can modify the Games-Chan algorithm so...

Full description

Bibliographic Details

Main Author:	Ana Salagean
Format:	Default Article
Published:	2005
Subjects:	Artificial intelligence not elsewhere classified Other information and computing sciences not elsewhere classified k-error linear complexity Linear complexity Repeated-root codes Stream cipher Artificial Intelligence and Image Processing Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/2325
Tags:	Add Tag No Tags, Be the first to tag this record!