Sieves for low autocorrelation binary sequences

DOI10.1109/TIT.1977.1055653MaRDI QIDQ4132111zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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)

Cited in

(9)

• Merit factors and Morse sequences
• On maximal autocorrelations of Rudin-Shapiro sequences
• Explicit merit factor formulae for Fekete and Turyn polynomials
• scientific article; zbMATH DE number 3614647 (Why is no real title available?)
• Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies
• scientific article; zbMATH DE number 1953470 (Why is no real title available?)
• Rudin-Shapiro-like polynomials in $L_{4}$
• The Perfect Binary Sequence of Period 4 for Low Periodic and Aperiodic Autocorrelations
• Limiting behavior of Rudin-Shapiro sequence autocorrelations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132111)