周期为pq阶为2^k的D-广义割圆序列的线性复杂度  

The linear complexity of new Ding-generalized cyclotomic sequences of order 2^k of length pq

作　　者：李胜强[1] 汪晓芬[1] 肖国镇[1] 

机构地区：[1]西安电子科技大学综合业务网理论与关键技术国家重点实验室,陕西西安710071

出　　处：《西安电子科技大学学报》2006年第2期322-326,共5页Journal of Xidian University

基　　金：国家自然科学基金资助项目(60473028J60404290135)

摘　　要：线性复杂度是度量序列随机性的一个最重要的指标.基于D-广义割圆,通过寻找序列的特殊的特征集,构造了一类周期为pq阶数为2k的D-广义割圆序列,并确定了该类序列的线性复杂度,其线性复杂度最小为(n-1)/2,最大为n.且该类序列为平衡序列.Linear complexity is the most important index for measuring the randomness properties of sequences. Based on the Ding-generalized cyclotomy, new generalized cyclotomic sequences of order 2^k of length pq are constructed by finding out a special characteristic set. The linear complexity of the sequences is determined. The minimum of the linear complexity is （n - 1 ）/2 and the maximum of the linear complexity is n. And the sequences are balanced.

关 键 词：D-广义割圆 特征集 线性复杂度 

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