Computing the linear complexity for sequences with characteristic polynomial f^v

We present several generalisations of the Games–Chan algorithm. For a fixed monic irreducible polynomial f we consider the sequences s that have as a 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

Saved in:
Bibliographic Details
Main Authors: Ana Salagean, Alex J. Burrage, Raphael C.-W. Phan
Format: Default Article
Published: 2013
Subjects:
Other information and computing sciences not elsewhere classified
Linear complexity
Games–Chan algorithm
Linear recurrent sequences
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/12396
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/12396

Similar Items