二元周期序列4-错误序列的研究  

On the 4-error sequence distribution of 2^n-periodic binary sequences

作　　者：周建钦[1,2] 刘军[1] 

机构地区：[1]杭州电子科技大学通信工程学院,浙江杭州310018 [2]安徽工业大学计算机学院,安徽马鞍山243032

出　　处：《苏州科技学院学报（自然科学版）》2012年第3期1-5,共5页Journal of Suzhou University of Science and Technology （Natural Science Edition）

基　　金：浙江省自然科学基金资助项目(Y1100318;R1090138)

摘　　要：通过将周期为2n的二元序列的k-错线性复杂度的计算转化为求Hamming重量最小的错误序列的方法,研究序列的k-错线性复杂度的分布情况,讨论了序列不同k-错线性复杂度条件下对应的k-错误序列的分布情况。基于Games-Chan算法,给出了线性复杂度小于2n的2n周期二元序列的4-错线性复杂度分别为2n-1-(2m+2j)和2n-1-(2m+2j)+x情况下的4-错误序列的计数公式。同时,给出实例并使用计算机进行验证。By studying k-linear complexity of binary sequences with period 2^n,it is proposed tion of k-error linear complexity should be converted to finding error sequences with minimal that the computa- Hamming weight. Then the k-error sequences distribution that corresponds with the k-error linear complexity of sequence is dis- cussed. Based on Games-Chan algorithm, for k=4, the counting function on the k-error sequences of 2^n-periodic binary sequences whose linear complexity less than 2^n and the k-error linear complexity are 2^n-1-（2^n＋2^i） and 2^n-1- （2^n＋2^i）＋x is derived. Examples are presented to illustrate the results and checked by computer.

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

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