具有第二下降点8错线性复杂度的2~n周期序列  

2n-periodic binary sequences with 8-error linear complexity as the second descent point

作　　者：王喜凤[1] 周晓明[1] 周建钦[1] 

机构地区：[1]安徽工业大学计算机科学与技术学院,安徽马鞍山243002

出　　处：《苏州科技学院学报（自然科学版）》2015年第2期56-64,共9页Journal of Suzhou University of Science and Technology （Natural Science Edition）

基　　金：安徽省自然科学基金资助项目(1208085MF106);安徽省教育厅自然科学研究项目(KY2013Z025);国家自然科学基金资助项目(61300059)

摘　　要：基于构造方法和方体理论,研究以2错线性复杂度为第一下降点并以8错线性复杂度为第二下降点的周期为2n的二元序列,分析第一下降点与第二下降点的关系;并给出所有可能的8错线性复杂度的取值形式,同时推导出以2错线性复杂度为第一下降点并以8错线性复杂度为第二下降点的2n周期二元序列的完整的计数公式。使用文中方法,同样也可给出其他以k错线性复杂度第二下降点或第三下降点的二元序列相关性质。Based on the structural approach and cube theory,we investigated the 2n-periodic binary sequences with 2-error linear complexity as the first descent point and 8-error linear complexity as the second descent point and analyzed the relationship between the first descent point and the second descent point. All the possible values of the 8-error linear complexity were given. Then we derived the complete counting functions of 2n- periodic binary sequences with 2-error linear complexity as the first descent point and 8-error linear complexity as the second descent point. With this method, 2n-periodic binary sequences with k-error linear complexity as the second or third descent point can be obtained.

关 键 词：周期序列 线性复杂度 K错线性复杂度 方体理论 

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