一类六次剩余序列的k-错复杂度  

On the k-error linear complexity of a class of sextic residue sequences

作　　者：杜小妮[1] 陈智雄[2] 石永芳[3] 肖国镇[4] 

机构地区：[1]西北师范大学数学与信息科学学院,甘肃兰州730070 [2]莆田学院数学系,福建莆田351100 [3]甘肃联合大学数信学院,甘肃兰州730000 [4]西安电子科技大学综合业务网国家重点实验室,陕西西安710071

出　　处：《哈尔滨工程大学学报》2010年第1期133-136,共4页Journal of Harbin Engineering University

基　　金：甘肃省自然科学基金资助项目(096RJZA124);教育部科学技术研究重点基金资助项目(208148)

摘　　要：Hall's六次剩余序列及相关六次剩余序列都是重要的二元伪随机序列.将一类二元六次剩余序列视为有限域Fp上的序列,依据序列线性复杂度和有限域上多项式的次数的关系,利用Aly等人的方法,确定了该序列的k-错复杂度的精确值和部分取值范围.结果表明,该序列与Hall's六次剩余序列具有基本一致的稳定性,且当k=(p-1)/3时,其稳定性优于Hall's六次剩余序列.Hall＇s sextic residue sequence and other related sextic residue sequences are important pseudo random sequences.A class of binary sextic residue sequences was initially considered as sequences over a finite field Fp.Then according to the relationship between the linear complexity of a sequence and the order of its related polynomial in its finite field,the sextic residue sequence＇s exact values and bounds in k-error linear complexity were determined by Aly＇ s method.It was shown that this sequence has almost the same stability as Hall＇s sextic residue sequence;especially when k=（p-1）/3,the corresponding k-error linear complexity is larger than that of Hall＇s sextic residue sequence.

关 键 词：流密码系统 二元序列 线性复杂度 K-错线性复杂度 六次剩余序列 

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