15,555 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
On the calculation of the linear complexity of periodic sequences
Based on a result of Hao Chen in 2006 we present a general procedure how to reduce the determination of the linear complexity of a sequence over a finite field \F_q of period to the determination of the linear complexities of sequences over \F_q of period . We apply this procedure to some classes of
periodic sequences over a finite field \F_q obtaining efficient algorithms to determine the linear complexity
- …