THE 2-ERROR LINEAR COMPLEXITY OF 2~n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2~n-1  

作　　者：Zhu Fengxiang Qi Wenfeng 

机构地区：[1]Department of Applied Mathematics, Zhengzhou Informatin Engineering University, Zhengzhou 450002, China

出　　处：《Journal of Electronics(China)》2007年第3期390-395,共6页电子科学学刊（英文版）

基　　金：the National Natural Science Foundation of China (No.60373092).

摘　　要：Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = 2,3,the number of sequences with given k-error linear complexity and the expected k-error linear complexity are provided. Moreover,the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2^n-periodic periodic binary sequence with linear complexity 2^n - 1 and k = 2, 3, the number of sequences with given k-error linear complexity and the expected k-error linear.complexity are provided. Moreover, the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.

关 键 词：Linear complexity k-error linear complexity Periodic binary sequences Chan-Games algorithm 

分 类 号：TN918.1[电子电信—通信与信息系统]