d-元广义分圆序列的线性复杂度及自相关函数性质分析
doi: 10.3724/SP.J.1146.2012.00804
Analysis of the Linear Complexity and the Autocorrelation of a Class of d-ary Generalized Cyclotomic Sequence
-
摘要: 该文推广了Liu Fang等人(2010)给出的周期为pn, p为奇素数，n为正整数的广义分圆序列的构造，并确定了新构造序列的线性复杂度和自相关函数值的分布。结果表明，推广的构造保持了原构造的高线性复杂度等伪随机特性。由于取值更灵活，较之原构造新构造序列的数量要大得多。Abstract: The construction of the generalized cyclotomic sequence with lengthpn for a prime p and a positive integern given by Liu Fang et al. (2010) is generalized in this paper. The linear complexity and the autocorrelation values of the new defined sequences are also determined. The results show that the new defined sequences keep the pseudo-random properties of the original sequence, that is, the high linear complexity and undesirable autocorrelation properties. Owing to the flexible ways to assign values to different generalized cyclotomic classes, the new construction contains more classes of generalized cyclotomic sequences when it is compared with the original one.
-
Key words:
- Network security /
- Generalized cyclotomy /
- Linear complexity /
- Autocorrelation
-
计量
- 文章访问数: 2600
- HTML全文浏览量: 125
- PDF下载量: 609
- 被引次数: 0
下载:
