F_p上p^n-周期序列的k-错误序列  

k-error sequences of p^n-periodic sequences over F_p

作　　者：李鹤龄[1] 戚文峰[1] 

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

出　　处：《通信学报》2010年第6期19-24,共6页Journal on Communications

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

摘　　要：一些特殊的序列如Legendre序列,Sidelnikov序列等,近年来把它们看成Fp上周期序列并对其k-错误线性复杂度进行研究得到了广泛的关注,利用广义的Games-Chan算法,确定了Fp上pn-周期序列1-错误序列的个数,讨论了Fp上pn-周期序列的2-错误序列的个数,并且给出了Fp上pn-周期序列1-错误序列个数的均值,这里p为奇素数。Some special sequences such as Legendre sequences and Sidelnikov sequences is treated as periodic sequences and its k-error linear complexity is widely researched in recent years.With extented Games-Chan algorithm,the number of 1-error sequences of pn-periodic sequences over Fp was given,and the number of 2-error sequences was discussed too;Further more,the expected value of the number of 1-error sequences of pn-periodic sequences over Fp was also shown,here p was an odd prime.

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

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