现多重周期序列联合2-adic复杂度的稳定性  

Stability of Joint 2-adic Complexity of Multi-periodic Sequence

作　　者：赵璐[1] 温巧燕[1] 

机构地区：[1]北京邮电大学网络与交换技术国家重点实验室,北京100876

出　　处：《电子与信息学报》2011年第1期185-189,共5页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(60873191;60903152;60821001);北京市自然科学基金(4072020)资助课题

摘　　要：该文首次提出了联合k-错2-adic复杂度的概念,并与联合k-错2-adic复杂度一齐作为衡量多重周期序列联合2-adic复杂度稳定性的指标。随后分别研究了两种联合错2-adic复杂度意义下的序列计数问题以及满足2N-1=p,p1 p2的周期为N的m重序列联合错2-adic复杂度数学期望的下界并说明了不存在2N-1=p e(e>1)的情况。该文的结果对于研究多重周期序列联合2-adic复杂度的稳定性有重要意义。In this paper,the definition of joint k-error 2-adic complexity is first proposed,as well as joint k-error 2-adic complexity is used to measure the stability of 2-adic complexity of periodic multisequences.Then some enumeration results are derived for two kinds of joint error 2-adic complexity and the lower bounds are presented for their expected values of m-fold multisequences of period N,which 2N-1=p,p1p2,respectively.Furthermore,it is showed that the formula 2N-1=pe（e〉1） has no solution.The results are important for studying the stability of joint 2-adic complexity of multisequences.

关 键 词：密码学 多重周期序列 联合2-adic复杂度 稳定性 数学期望 

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