Math @ Duke

Publications [#236046] of Robert Calderbank
Papers Published
 McGuire, G; Calderbank, AR, Proof of a conjecture of sarwate and pursley regarding pairs of binary msequences,
IEEE Transactions on Information Theory, vol. 41 no. 4
(1995),
pp. 11531155 [doi]
(last updated on 2018/11/18)
Abstract: Binary msequences are maximal length sequences generated by shift registers of length m, that are employed in navigation, radar, and spreadspectrum communications systems, because of their crosscorrelation properties. It is well known that given a pair of distinct msequences, the crosscorrelation function must take on at least three values. This correspondence 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 msequences. The proof makes essential use of a deep theorem of McEliece that restricts the possible weights that can occur in a binary cyclic code.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

