线性复杂度和k错线性复杂度是度量密钥流序列的密码强度的重要指标.通过研究周期为2"的二元序列线性复杂度,提出将k错线性复杂度的计算转化为求Hamming重量最小的错误序列.基于Games-Chan算法,讨论了线性复杂度为2~n的2~n周期二元序列的3错线性复杂度分布情况;给出了对应k错线性复杂度序列的完整计数公式,k=3,4.对于一般的线性复杂度为2~n-m的2~n周期二元序列,也可以使用该方法给出对应k错线性复杂度序列的计数公式. Linear complexity and k-error linear complexity are the important indexes to measure the cryptographic strength of the keystream sequence.By studying the linear complexity of binary sequences with period of 2 ’s, we propose to convert the computation of k-error linear complexity into Hamming The least weight error sequence based on the Games-Chan algorithm, the 3-error linear complexity distributions of 2 ~ n periodic binary sequences with 2 ~ n linear complexity are discussed. The completeness of the corresponding k-error linear complexity sequence Counting formula, k = 3, 4. For general 2 ~ n periodic binary sequence with 2 ~ nm linear complexity, this method can also be used to give the counting formula corresponding to k-error linear complexity sequence.