A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q)
Shimin Wei, Guozhen Xiao, Zhong Chen · IEEE Transactions on Information Theory · 2002
A fast algorithm is presented for determining the linear complexity and the minimal polynomial of a sequence with period 2p/sup n/ over GF (q), where p and q are odd prime, and q is a primitive root (mod p/sup 2/). The algorithm uses the fact that in this case the factorization of x/sup 2p(n)/-1 is especially simple.