中文摘要：

线性复杂度和k-错线性复杂度是度量密钥流序列的密码强度的重要指标。通过研究周期为2n的二元序列的线性复杂度,该文提出将k-错线性复杂度的计算转化为求Hamming重量最小的错误序列。基于Games-Chan算法,讨论了线性复杂度为2n-m的2n-周期二元序列的k-错线性复杂度分布情况。当（m,k）=（5,4）,（6,4）,（7,8）,（8,2）时,分别给出了对应k-错线性复杂度序列的计算公式。对于一般的m,也可以使用该方法给出对应k-错线性复杂度序列的计算公式。

英文摘要：

The linear complexity and k-error linear complexity of a sequence have been used as important measures of keystream sequence strength.By studying linear complexity of binary sequences with period 2n,it is proposed that the computation of k-error linear complexity should be converted to finding error sequences with minimal Hamming weight.Based on Games-Chan algorithm,k-error linear complexity distribution of 2n-periodic binary sequences with linear complexity 2n-m is discussed.When（m,k）=（5,4）,（6,4）,（7,8）,（8,2）,the complete counting functions on the k-error linear complexity of 2n-periodic binary sequences are presented separately.For general m,the complete counting functions on the k-error linear complexity of 2n-periodic binary sequences with linear complexity 2n-m can be obtained using a similar approach.