二元周期序列的k错误线性复杂度  

On the k-Error Linear Complexity of Binary Period Sequences

作　　者：赵耀东[1] 戚文峰[1] 

机构地区：[1]郑州信息工程大学信息工程学院应用数学系,郑州450002

出　　处：《电子学报》2005年第1期12-16,共5页Acta Electronica Sinica

基　　金：全国优秀博士学位论文专项基金 (No .2 0 0 0 60 );国家自然科学基金 (No.60 3730 92 )

摘　　要：随着k的增大 ,序列k错误线性复杂度的值会从线性复杂度递减到 0 .对于周期为 2的方幂的二元序列 ,Kurosawa讨论了线性复杂度和k错误线性复杂度的关系 ,给出了使得序列的k错误线性复杂度严格小于序列的线性复杂度最小的k值 .本文利用多项式的权重关系给出了使得序列k错误线性复杂度再次减小的最小k值 .With the increase of k, the k-error linear complexity will decrease to 0 from the value of the linear complexity of the sequences. For the binary sequences whose period is a power of 2, a relationship between the linear complexity and k-error linear complexity is discussed by Kurosawa, which indicates the least value of the positive integer k such that the k-error linear complexity less than linear complexity. In this paper, using the Hamming weight of polynomials, the least k is given such that the k-error linear complexity decreased again.

关 键 词：序列密码 线性复杂度 k错误线性复杂度 

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