Fast Algorithms for Determining the Linear Complexity of Sequences Over $hboxGF,(p^m)$ With Period $2^tn$
Hui Chen · IEEE Transactions on Information Theory · 2005
We prove a result which reduces the computation of the linear complexity of a sequence over GF(pm) (p is an odd prime) with period 2n (n is a positive integer such that there exists an element bisinGF(pm), bn=-1) to the computation of the linear complexities of two sequences with period n. By combining with some known algorithms such as the Berlekamp-Massey algorithm and the Games-Chan algorithm we can determine the linear complexity of any sequence over GF(pm) with period 2tn (such that 2t|pm-1 and gcd(n,pm-1)=1) more efficiently