Title :
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)
Author :
Xiao, Guozhen ; Wei, Shimin ; Lam, Kwok Yan ; Imamura, Kyoki
Author_Institution :
Nat. Key Lab. of ISN, Xidian Univ., Xi´´an, China
fDate :
9/1/2000 12:00:00 AM
Abstract :
A fast algorithm is presented for determining the linear complexity of a sequence with period pn over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p2)
Keywords :
Galois fields; computational complexity; cryptography; number theory; sequences; GF(q); fast algorithm; linear complexity; number theory; sequences; Binary sequences; Equations; Feedback; Notice of Violation;
Journal_Title :
Information Theory, IEEE Transactions on
