A fast algorithm for determining the linear complexity of a sequence with period p(n) over GF (q)
A fast algorithm is presented for determining the linear complexity of a sequence with period p(n) over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p(2)).
fast algorithm linear complexity codes cryptography periodic sequence