An Algorithm for the k-Error Linear Complexity of Sequences over GF(pm) with Period pn, p a Prime

AbstractAn algorithm is given for the k-error linear complexity of sequences over GF(pm) with period pn, p a prime. The algorithm is derived by the generalized Games–Chan algorithm for the linear complexity of sequences over GF(pm) with period pn and by using the modified cost different from that used in the Stamp–Martin algorithm for sequences over GF(2) with period 2n. A method is also given for computing an error vector which gives the k-error linear complexity