Exhaustive search for low-autocorrelation binary sequences
Open accessThe DOI matches its Crossref record.
Abstract
Binary sequences with low autocorrelations are important in communication engineering and in statistical mechanics as ground states of the Bernasconi model. Computer searches are the main tool in the construction of such sequences. Owing to the exponential size of the configuration space, exhaustive searches are limited to short sequences. We discuss an exhaustive search algorithm with run-time characteristic and apply it to compile a table of exact ground states of the Bernasconi model up to N = 48. The data suggest F > 9 for the optimal merit factor in the limit .
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
New Algorithms for Designing Unimodular Sequences With Good Correlation Properties
Stoica, P., He, H., & Li, J. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2012562 · Cited by 475
Optimization Methods for Designing Sequences With Low Autocorrelation Sidelobes
Song, J., Babu, P., & Palomar, D. P. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2425808 · Cited by 382
UAV Path Planning Using Optimization Approaches: A Survey
Ait Saadi, A., Soukane, A., Meraihi, Y., Benmessaoud Gabis, A., Mirjalili, S., & Ramdane-Cherif, A. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09742-7 · Cited by 269
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
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
Self-citation
Metadata
- Authors
- Mertens, S.
- Venue
- Journal of Physics A: Mathematical and General
- Publisher
- IOP Publishing
- Published
- 1996-09-21
- Volume
- 29
- Issue
- 18
- Pages
- L473-L481
- ISSN
- 0305-4470 (ISSN-L)
- 1361-6447
- OpenAlex
- W2140798944
- Cited by
- 91
- References
- 0
- FWCI
- 1.92
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Exhaustive search for low-autocorrelation binary sequences. https://app.cochat.ai/papers/10.1088/0305-4470/29/18/005
- The paper
- Mertens, S. (1996). Exhaustive search for low-autocorrelation binary sequences. Journal of Physics A: Mathematical and General. https://doi.org/10.1088/0305-4470/29/18/005
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.