Definitive Cycle Sequence k-Error Linear Complexity of the Fast Algorithm
Shimin Wei · 2012
This paper gives a definitive cycle sequence's k-error linear complexity of the fast algorithm,with GF(q) on the period of qpm sequence,discussing its correct.which p and q are the primes,but q is a primitive root of modulo p2.