An efficient algorithm for the k-error linear complexity of periodic sequences
Xiao Guo-zhen · Jounal of Xidian University · 2001
An efficient algorithm for computing the k-error linear complexity of a sequence with period pn over GF(q) is presented, where p and q are primes, with q a primitive root modulo p2. The new algorithm is a generalization of an algorithm presented by Xiao, Wei, Lam and Imamura.