A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)
Guozhen Xiao, Shimin Wei, Kwok‐Yan Lam, Kyoki Imamura · IEEE Transactions on Information Theory · 2000
A fast algorithm is presented for determining the linear complexity of a sequence with period p/sup n/ over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p/sup 2/).