On the 6-Error Linear Complexity of 2n-Periodic Balanced Binary Sequences
Chen Jia-ru · Journal of Hangzhou Dianzi University · 2011
The linear complexity and the k-error linear complexity of a sequence have been used as important measures of keystream sequence strength.The k-error linear complexity of periodic sequence is defined to be the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period.Based on Games-Chan algorithm,6-error linear complexity distribution of 2n-periodic binary sequences with linear complexity less than 2n is discussed.The complete counting functions on 2n-periodic balanced binary sequences with 6-error linear complexity 2n-2,2n-3 and 2n-3+1 are derived respectively.