On the First and Second Critical Error Linear Complexity of Binary 2^n-periodic Sequences  

作　　者：CHANG Zuling WANG Xueyuan 

机构地区：[1]Department of Mathematics, Zhengzhou University, Zhengzhou 450001, China [2]School of Information Engineering, Zhengzhou University, Zhengzhou 450001, China

出　　处：《Chinese Journal of Electronics》2013年第1期1-6,共6页电子学报（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China （No.61174085, No.61170270, No.61121061）.

摘　　要：This paper studies the error linear com-plexity of binary sequences with period 2^n. One new rep-resentation of binary sequences with period 2^n and new interpretation of Games-Chan algorithm are given. New properties about the first critical error linear complexity and one algorithm to compute the first critical error linear complexity are given. One formula of the minimum value k for which the k-error linear complexity is strictly less than the first critical error linear complexity is provided.

关 键 词：Sequence Games-Chan algorithm Lin-ear complexity Error linear complexity. 

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