2~mp^n周期二元序列的线性复杂度和k错线性复杂度  

Linear complexity and k-error linear complexity for 2~mp^n-periodic binary sequences

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

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

出　　处：《通信学报》2008年第7期44-49,61,共7页Journal on Communications

基　　金：国家自然科学基金资助项目(60673081);国家高技术研究发展计划("863"计划)基金资助项目(2006AA01Z417)~~

摘　　要：序列线性复杂度的稳定性是衡量其随机性好坏的一个重要指标。针对2mpn周期二元序列,利用多项式分解等工具,确定了使得序列的k错线性复杂度严格小于其线性复杂度的最小k值的上下界,其中n是正整数,m是非负整数,p是奇素数,2是模p2的原根。The stability of the linear complexity was an important index to scale a sequence＇s randornicity. For 2^mp^n-periodic binary sequences, where p was a odd prime and 2 was a primitive root module p^2, made use of the tools such as polynomial factorization, provides the bounds of the minimum value k such that the k-error linear complexity is strictly less than the linear complexity.

关 键 词：序列密码 二元周期序列 线性复杂度 K错线性复杂度 

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