The 2-error Linear Complexity of 2n-Periodic Binary Sequences  

作　　者：ZHU Fengxiang QI Wenfeng 

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

出　　处：《Chinese Journal of Electronics》2008年第2期356-360,共5页电子学报（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China （No.60673081） and the National High Technology Research and Development 863 Program of China （No.2006AA01Z417）.

摘　　要：Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of key sequences. For a random 2n-periodic binary sequence, the number of sequences with given 2-error linear complexityis provided. Then the expected 2-error linear complexity of a random 2n-periodic binary sequence is given.

关 键 词：Linear complexity k-error linear complexity Periodic binary sequences Expect. 

分 类 号：TP30[自动化与计算机技术—计算机系统结构]