3 research outputs found
How to determine linear complexity and -error linear complexity in some classes of linear recurring sequences
Several fast algorithms for the determination of the linear complexity of -periodic sequences over a finite
field \F_q, i.e. sequences with characteristic polynomial , have been proposed in the literature.
In this contribution fast algorithms for determining the linear complexity of binary sequences with characteristic
polynomial for an arbitrary positive integer , and are presented.
The result is then utilized to establish a fast algorithm for determining the -error linear complexity of
binary sequences with characteristic polynomial