Abstract：The linear complexity and the k-error linear complexity of a sequence are used as important measures of keystream strength. By studying linear complexity of binary sequences with period 2n, it is proposed that the computation of k-error linear complexity can be converted to finding error sequences with minimal Hamming weight. In order to study sequence randomness, the k-error sequences distribution that corresponds with the k-error linear complexity of sequence is discussed. Based on Games-Chan algorithm, for k=3, the counting functions on the k-error sequences of 2n-periodic binary sequences with linear complexity 2n- are derived and the effectiveness is proved with computer programming.
周建钦, 刘军. 2n-周期二元序列的3-错误序列分布[J]. 电子与信息学报, 2012, 34(8): 1923-1927.
Zhou Jian-Qin, Liu Jun. On the 3 error Sequence Distribution of 2n-periodic Binary Sequences. , 2012, 34(8): 1923-1927.
2012, Vol. 34 
