journal6 ›› 2012, Vol. 33 ›› Issue (3): 32-35.DOI: 10.3969/j.issn.1007-2985.2012.03.009

• Computer • Previous Articles     Next Articles

On the 4-Error Sequence Distribution of 2n-Periodic Binary Sequences


  1. (1.Telecommunication School,Hangzhou Dianzi University,Hangzhou 310018,China;2.Computer Science School,Anhui University of Technology,Ma’anshan 243032,Anhui China)
  • Online:2012-05-25 Published:2012-08-24

Abstract: The k-error linear complexity of a sequence has been used as one of the important measure of keystream strength.In order to better depict and study randomicity of sequences,the k-error sequencesedistribution that corresponds with LCk(sLC(s+e) is discussed by studying the distribution of k-error linear complexity of binary sequences  (s) with period 2n.Based on Games-Chan algorithm,it is proposed that the computation of k-error linear complexity should be converted to finding error sequences with minimal Hamming weight.For k=4,some the counting functions on the k-error sequences of 2n-periodic binary sequences with linear complexity less than 2n are derived.

Key words: stream cipher, linear complexity, k-error linear complexity, k-error sequences

WeChat e-book chaoxing Mobile QQ