二元序列线性复杂度谱的进一步研究  

Further Research on the Linear Complexity Profile for Binary Sequences

作　　者：谭林[1] 戚文峰[1] 

机构地区：[1]信息工程大学信息工程学院,河南郑州450002

出　　处：《信息工程大学学报》2011年第4期400-403,共4页Journal of Information Engineering University

基　　金：国家自然科学基金资助项目(61070178;60833008)

摘　　要：伪随机序列要求具有好的线性复杂度谱。在任何衡量线性复杂度谱好坏的指标下,对二元序列s和其补序列sc的评价地位应该是相等的,但d-perfect的序列的补序列不一定是d-perfect的。如果s和sc同时是d-perfect的,文章称其是truly d-perfect的序列,给出了truly d-perfect的n长二元序列对的计数函数B*|d(n)的递推关系。Pseudorandom sequences should hold good linear complexity profile. Under any measure for the linear complexity profile, the status of binary sequence s and its complement sc should be equivalent. But the complement of a binary sequence with d-perfect linear complexity profile may not be d-perfect. If binary sequence s and its complement sc are both d-perfect, they are called truly d-perfect sequences in this paper. This paper derives the recursive formula for B. ｜d （n） counting the pairs of the truly d-perfect binary sequences with length n.

关 键 词：序列密码 线性复杂度 线性复杂度谱 完美谱 

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