一类新的周期为p^(m+1)q^(n+1)的二元广义分圆序列的线性复杂度  

The Linear Complexity of a New Class of Generalized Cyclotomic Binary Sequences of Length p^(m+1)q^(n+1)

作　　者：柯品惠[1] 李瑞芳[1] 张胜元[1] 

机构地区：[1]福建师范大学福建省网络安全与密码技术重点实验室,福建福州350007

出　　处：《电子学报》2014年第5期1009-1013,共5页Acta Electronica Sinica

基　　金：国家自然科学基金(No.61102093;No.U1304604)

摘　　要：提出了一类新的周期为pm+1qn+1,p和q为不同的奇素数,m和n为正整数的广义分圆序列,并计算了该序列的线性复杂度.新构造的序列具有平衡的优点.A new class of generalized cyclotomic binary sequence of length pm＋1qn＋1 is proposed in this paper, where p and q are distinct odd primes. The linear complexity of the proposed sequence is also determined. Furthermore, the proposed sequence is balanced.

关 键 词：有限域 广义分圆 线性复杂度 

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