The Merit Factor of Long Low Autocorrelation Binary Sequences

IEEE Transactions on Information Theory

Volumn 28, Issue 3, 1982, Pages 543-549

  Golay, Marcel J E ^a  

^a PERKINELMER INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

EID: 0020125428     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1982.1056505     Document Type: Article

References (5)

1. A. B. Boehmer, “Binary pulse compression codes,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 156-167, Apr. 1967.
2. R. Turyn, “Sequences with small correlation,” in Error Correcting Codes, Henry B. Mann, Ed. New York: Wiley, 1968, pp. 195-228.
3. M. R. Schroeder, “Synthesis of low peak factor signals and binary sequences with low autocorrelation,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 85-89, Jan. 1970.
4. J. Lindner, “Binary sequences up to length 40 with best possible autocorrelation function,” Electron. Lett., vol. 11, p. 507, Oct. 1975.
5. Marcel J. E. Golay, “Sieves for low autocorrelation binary sequences,” IEEE Trans. Inform. Theory, vol. IT-23, Jan. 1977.