Research on k-error Linear Complexity of Periodic Binary Sequences
La Feng · Journal of Hangzhou Dianzi University · 2011
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.