The DOI matches its Crossref record.
The merit factor of long low autocorrelation binary sequences (Corresp.)
Abstract
The asymptotic "merit factor," i.e, the ratio of central to sidelobe energy of extremely long, optimally Iow autocorrelation sequences, formerly calculated as2e^{2}=14.778 \cdotswith the use of an ergodicity hypothesis and a convenient, but faulty, approximation, is recalculated without that approximation and is established at12.32 \cdots.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Shaydulin, R., Li, C., Chakrabarti, S., DeCross, M., Herman, D., Kumar, N., Larson, J., Lykov, D., Minssen, P., Sun, Y., et al. (2024) · Science Advances · doi:10.1126/sciadv.adm6761 · Cited by 120
Finding low autocorrelation binary sequences with memetic algorithms
Gallardo, J. E., Cotta, C., & Fernández, A. J. (2009) · Applied Soft Computing · doi:10.1016/j.asoc.2009.03.005 · Cited by 59
Low autocorrelation binary sequences
Packebusch, T., & Mertens, S. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/16/165001 · Cited by 64
Bošković, B., Brglez, F., & Brest, J. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.02.024 · Cited by 31
Metadata
- Authors
- Golay, M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1982-05
- Volume
- 28
- Issue
- 3
- Pages
- 543-549
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2158124810
- Cited by
- 195
- References
- 0
- FWCI
- 2.44
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The merit factor of long low autocorrelation binary sequences (Corresp.). https://app.cochat.ai/papers/10.1109/tit.1982.1056505
- The paper
- Golay, M. (1982). The merit factor of long low autocorrelation binary sequences (Corresp.). IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1982.1056505
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.