机构地区: 西安电子科技大学通信工程学院综合业务网理论与关键技术国家重点实验室
出 处: 《计算机科学》 2007年第4期77-78,共2页
摘 要: 线性复杂度是度量序列随机性的一个重要指标。基于W-割圆理论,通过寻找序列特殊的特征集,构造了Zpq环上一类新的2k(k>1)阶二元广义割圆序列,给出了该类序列的极小多项式和线性复杂度。其线性复杂度最小为(p+1)(q-1)/2,最大为(q-1)p。结果表明,该类序列具有良好的线性复杂度性质。 Linear complexity is the most important index for measuring the randomness properties of sequences. Based on the White-generalized cyclotomy, new binary generalized cyclotomic sequences of order 2^k (k〉l) over Zpq of length pq are constructed by finding out a special characteristic set. Theminimal polynomials and linear complexity(L(s^∞) ) of these new sequences are determined. The minimum of L(s^∞) is (p+1)(q-1)/2and the maximum(q-1)p. It is shownthat these sequences have good linear complexity.