Fast algorithms for determining the linear complexity of sequences over GF(p/sup m/) with period 2/sup t/n |
| |
Authors: | Hao Chen |
| |
Institution: | Dept. of Comput. & Inf. Technol., Fudan Univ., Shanghai; |
| |
Abstract: | 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 2 t|pm-1 and gcd(n,pm-1)=1) more efficiently |
| |
Keywords: | |
|
|