By Topic

A new family of Gold-like sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Khoongming Khoo ; Centre for Appl. Cryptographic Res., Waterloo Univ., Ont., Canada ; Guang Gong ; Stinson, D.R.

Families of sequences with low cross correlation have important applications in CDMA communications and cryptography. One class of such sequences are those which have period 2n-1 and cross correlation values -1, -1±2 (n+1)2/ with m-sequence represented by Tr(x) when n is odd. These sequences are called Gold-like sequences and they are well studied in the literature, In this paper, we generalise their concept and consider sequences over GF(2n), n odd. Using techniques from linear algebra and coding theory, we can efficiently determine if the sequence is Gold-like by a polynomial gcd computation. Using the tools developed, we prove that the sequence is Gold-like for all choice of coefficients if and only if n is a prime of certain form.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002