An Efficient Algorithm for Computing the k-Error Linear Complexity Spectrum of Periodic Sequences
Ling Yong, Hao Cao · Advanced materials research · 2012
An efficient algorithm for computing the k-error linear complexity spectrum of a q- ary sequence s with period 2 pn is presented, where q is an odd prime and a primitive root modulo p2. The algorithm generalizes both the Wei-Xiao-Chen and the Wei algorithms, The new algorithm can compute the k-error linear complexity spectrum of s using at most 4 n+1 steps.