On the k-error Linear Complexity of Sequences with Period pn over GF(q)
Jianqin Zhou, Shangguan Cheng · 2008
We investigate the minimum value m(S) of k for which the k-error linear complexity is strictly less than the linear complexity of a given sequence S with period N=pnover GF(q). The upper and lower bounds on m(S) are derived to show the relationship between the linear complexity of a given pn-periodic sequence over GF(q) and the minimum value m(S). Numerical examples are given to verify the results.