A simple unpredictable pseudo random number generator
SIAM Journal on Computing
Shift Register Sequences
Optimum OVSF code reassignment in wideband CDMA forward radio link
Information Sciences: an International Journal
Sequences related to Legendre/Jacobi sequences
Information Sciences: an International Journal
An analysis of the structure and complexity of nonlinear binary sequence generators
IEEE Transactions on Information Theory
Linear complexity of new generalized cyclotomic sequences of order two of length pq
IEEE Transactions on Information Theory
Linear Complexity of Generalized Cyclotomic Binary Sequences of Order 2
Finite Fields and Their Applications
New Generalized Cyclotomy and Its Applications
Finite Fields and Their Applications
Frontiers of Computer Science in China
A generalization of the Hall's sextic residue sequences
Information Sciences: an International Journal
Hi-index | 0.07 |
This paper contributes to trace representation of some generalized cyclotomic sequences of length pq(p,qprime), which are defined by Ding and Helleseth. From the relations between these sequences and the Legendre sequence, we firstly confirm the defining pairs of these sequences of arbitrary order. Then, we obtain their trace representation, from which we give their linear complexity using Key's method. It can be seen that Bai et al.'s conclusion is a special case of our result when the order is two. Finally, an example is given to illustrate the validity of our result.