m-tight error linear complexity of sequences over GF(pm) with period pn
GF(pm)上周期为pn序列的m紧错线性复杂度*

Using the theories of linear complexity, k-error linear complexity, the k-error linear complexity profile and the mi-nimum error, this paper presented the notion of m-tight error linear complexity. Moreover, gave an efficient algorithm for computing m-tight error linear complexity based on the algorithm for computing k-error linear complexity of sequences over GF(pm) with period pn, where p was a prime. It realized the proposed algorithm with C language, and also gave the experiment results here.