The linear complexity of new generalized cyclotomic binary sequences of order four

Authors:
Tongjiang Yan;Li Hong;Guozhen Xiao
Affiliations:
College of Mathematics and Computational Science, China University of Petroleum, Dongying 257061, China and ISN National Key Laboratory, Xidian University, Xi'an 710071, China;College of Computer and Communication Engineering, China University of Petroleum, Dongying 257061, China;ISN National Key Laboratory, Xidian University, Xi'an 710071, China
Venue:
Information Sciences: an International Journal
Year:
2008

Citing 9
Cited 4

Optimum OVSF code reassignment in wideband CDMA forward radio link

Information Sciences: an International Journal
Finding an internal state of RC4 stream cipher

Information Sciences: an International Journal
On the linear complexity of Legendre sequences

IEEE Transactions on Information Theory
Autocorrelation values of generalized cyclotomic sequences of order two

IEEE Transactions on Information Theory
Generalized cyclotomic codes of length p1e(1)...pte(t)

IEEE Transactions on Information Theory
On the linear complexity of Hall's sextic residue sequences

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

Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2k

Information Sciences: an International Journal
On the autocorrelation and the linear complexity of q-ary prime n-square sequences

SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq

Frontiers of Computer Science in China
Linear complexity of quaternary sequences of length pq with low autocorrelation

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.07

Visualization

Abstract

Whiteman generalized cyclotomic sequences are proven to exhibit a number of good randomness properties. In this paper we determine the linear complexity of some newly generalized cyclotomic sequences, of order four with period pq which are defined by Ding and Helleseth. The results show that all of these sequences have high linear complexity.