A fast algorithm for the k-error linear complexity of a binary sequence

An efficient algorithm is presented for computing the k-error linear complexity of a binary sequence with period p/sup n/, where 2 is a primitive root modulo p/sup 2/. The new algorithm is a generalization of an algorithm over a binary field presented by Xiao et al. (1999).