By Topic

Proof of a conjecture of Sarwate and Pursley regarding pairs of binary m-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
$33 $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

2 Author(s)
G. McGuire ; Dept. of Math., California Inst. of Technol., Pasadena, CA, USA ; A. R. Calderbank

Binary m-sequences are maximal length sequences generated by shift registers of length m, that are employed in navigation, radar, and spread-spectrum communications systems, because of their crosscorrelation properties. It is well known that given a pair of distinct m-sequences, the crosscorrelation function must take on at least three values. The article considers crosscorrelation functions that take on exactly three values, and where these values are preferred in that they are small. The main result is a proof of a conjecture made by Sarwate and Pursley in 1980, that if m≡0 (mod 4) then there are no preferred pairs of binary m-sequences. The proof makes essential use of a deep theorem of McEliece (1971) that restricts the possible weights that can occur in a binary cyclic code

Published in:

IEEE Transactions on Information Theory  (Volume:41 ,  Issue: 4 )