|
|
|
| Analysis of the Linear Complexity and the Autocorrelation of a Class of d-ary Generalized Cyclotomic Sequence |
| Ke Pin-hui Li Rui-fang Zhang Sheng-yuan |
| Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fuzhou 350007, China |
|
|
|
|
Abstract The construction of the generalized cyclotomic sequence with length pn for a prime p and a positive integer n 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.
|
|
Received: 25 June 2012
|
|
|
|
Corresponding Authors:
Ke Pin-hui
E-mail: keph@fjnu.edu.cn
|
|
|
|
|
|
|
2012, Vol. 34 
