Sieves for low autocorrelation binary sequences

DOI10.1109/TIT.1977.1055653zbMath0359.94019OpenAlexW2123547620WikidataQ60043153 ScholiaQ60043153MaRDI QIDQ4132111

Marcel J. E. Golay

Publication date: 1977

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1977.1055653

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (8)

Unnamed Item ⋮ Unnamed Item ⋮ On maximal autocorrelations of Rudin-Shapiro sequences ⋮ Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies ⋮ Explicit merit factor formulae for Fekete and Turyn polynomials ⋮ The Perfect Binary Sequence of Period 4 for Low Periodic and Aperiodic Autocorrelations ⋮ Rudin-Shapiro-like polynomials in $L_{4}$ ⋮ Merit factors and Morse sequences

This page was built for publication: Sieves for low autocorrelation binary sequences