中文摘要：

线性复杂度和k错线性复杂度分别是度量密钥流序列的密码强度和稳定性的重要指标。该文通过研究2n-周期二元序列的线性复杂度,提出将k错线性复杂度的计算转化为求Hamming重量最小的错误序列;对线性复杂度为2n的2n-周期二元序列的k错线性复杂度的分布进行分析,给出这类周期序列的k错线性复杂度期望的上、下界。该结论推广了一个参考文献中的主要结果。

英文摘要：

The linear complexity and the k-error linear complexity of a sequence have been used as important measures of keystream sequence strength and stability.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.The distribution of the k-error linear complexity of 2n-periodic binary sequences with linear complexity 2n is discussed,where k is odd.The upper and lower bounds of the expectation of the k-error linear complexity of these periodic sequences are presented.Moreover,the conclusion here is the generalization of one of the main results in the bibliography.