The Linear Complexity of a New Class of Generalized Cyclotomic Sequence with Period

Li Rui-Fang; Ke Pin-Hui

doi:10.3724/SP.J.1146.2013.00751

Volume 36 Issue 3

Apr. 2014

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2014 > 36(3): 650-654

Li Rui-Fang, Ke Pin-Hui. The Linear Complexity of a New Class of Generalized Cyclotomic Sequence with Period[J]. Journal of Electronics & Information Technology, 2014, 36(3): 650-654. doi: 10.3724/SP.J.1146.2013.00751

Citation:

Li Rui-Fang, Ke Pin-Hui. The Linear Complexity of a New Class of Generalized Cyclotomic Sequence with Period[J]. Journal of Electronics & Information Technology, 2014, 36(3): 650-654. doi: 10.3724/SP.J.1146.2013.00751

Citation:

PDF( 190 KB)

The Linear Complexity of a New Class of Generalized Cyclotomic Sequence with Period

doi: 10.3724/SP.J.1146.2013.00751 cstr: 32379.14.SP.J.1146.2013.00751

Received Date: 2013-05-27
Rev Recd Date: 2013-08-12
Publish Date: 2014-03-19

Abstract

Abstract

A new class of generalized cyclotomic sequence with period2pq is proposed in this paper, wherep andq are distinct primes. A formula for computing the linear complexity of the proposed sequence is also given. With the knowledge of the support set of the generalized cyclotomic sequence, its linear complexity can be easily determined using the formula.
- Crpytography,
- Finite fields,
- Generalized cyclotomic sequence,
- Linear complexity