GF(p^m)上周期为p^n序列的m紧错线性复杂度

m-tight error linear complexity of sequences over GF(p^m) with period p^n

综合线性复杂度、k错线性复杂度、k错线性复杂度曲线和最小错误minerror（S）的概念,提出紧错线性复杂度的概念。在GF（pm）上周期为pn序列的k错线性复杂度快速算法的基础上,给出m紧错线性复杂度的快速算法。其中p是素数。编程实现了该算法,并给出实验结果。

Using the theories of linear complexity,k-error linear complexity,the k-error linear complexity profile and the minimum 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.