Linear complexity for sequences with characteristic polynomial fv

We present several generalisations of the Games- Chan algorithm. For a fixed monic irreducible polynomial f we consider the sequences s that have as characteristic polynomial a power of f. We propose an algorithm for computing the linear complexity of s given a full (not necessarily minimal) period...

Full description

Bibliographic Details

Main Authors:	Alex J. Burrage, Ana Salagean, Raphael C.-W. Phan
Format:	Default Conference proceeding
Published:	2011
Subjects:	Other information and computing sciences not elsewhere classified untagged Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/9480
Tags:	Add Tag No Tags, Be the first to tag this record!