Low autocorrelation binary sequences
Open accessThe DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
Binary sequences with minimal autocorrelations have applications in communication engineering, mathematics and computer science. In statistical physics they appear as groundstates of the Bernasconi model. Finding these sequences is a notoriously hard problem, that so far can be solved only by exhaustive search. We review recent algorithms and present a new algorithm that finds optimal sequences of length N in time . We computed all optimal sequences for and all optimal skewsymmetric sequences for .
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“First, the complexity of LABS grows rapidly, with optimal solutions known only for N ≤ 66 and the best heuristics producing approximate solutions of quality decaying with N for N200 (20, 21).”
From Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem (2024) · cites this paper as [21]
The cited source says what the claim attributes to it.
In the citing paper
“Second, the performance of classical solvers for LABS has been benchmarked (20, 21) in terms of the scaling of their TTS with problem size.”
From Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem (2024) · cites this paper as [21]
The cited source says what the claim attributes to it.
In the citing paper
“First, the complexity of LABS grows rapidly, with optimal solutions known only for N ≤ 66 and the best heuristics producing approximate solutions of quality decaying with N for N200 (20, 21).”
From Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem (2024) · cites this paper as [21]
The cited source says what the claim attributes to it.
In the citing paper
“Specifically, the value of the best-known merit factor decreases notably for high N, whereas the asymptotic limit predicts that the merit factor should stay approximately constant.”
From Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem (2024) · cites this paper as [21]
The cited source says what the claim attributes to it.
In the citing paper
“Specifically, we observe that for both solvers the time to produce a certificate of optimality (TTO) scales with an exponent within a 95% confidence interval of the 1.73 exponent reported in (21).”
From Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem (2024) · cites this paper as [21]
2 more claims about this paper
Create a free account to see every claim other papers make about this one.
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
Cites
Fourth test of general relativity
Shapiro, I. I. (1964) · Physical Review Letters · doi:10.1103/physrevlett.13.789 · Cited by 1,137
A Survey of Combinatorial Gray Codes
Savage, C. (1997) · SIAM Review · doi:10.1137/s0036144595295272 · Cited by 482
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Self-citationFourth Test of General Relativity: Preliminary Results
Shapiro, I. I., Pettengill, G. H., Ash, M. E., Stone, M. L., Smith, W. B., Ingalls, R. P., & Brockelman, R. A. (1968) · Physical Review Letters · doi:10.1103/physrevlett.20.1265 · Cited by 208
The merit factor of long low autocorrelation binary sequences (Corresp.)
Golay, M. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056505 · Cited by 195
Low autocorrelation binary sequences : statistical mechanics and configuration space analysis
Bernasconi, J. (1987) · Journal de Physique · doi:10.1051/jphys:01987004804055900 · Cited by 188
Self induced quenched disorder: a model for the glass transition
Bouchaud, J. P., & Mézard, M. (1994) · Journal de Physique I · doi:10.1051/jp1:1994240 · Cited by 178
Turyn, R. J., & Storer, J. (1961) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1961-0125026-2 · Cited by 151
Replica field theory for deterministic models: I. Binary sequences with low autocorrelation
Marinari, E., Giorgio Parisi, A., & Ritort, F. (1994) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/27/23/010 · Cited by 144
Computational Excursions in Analysis and Number Theory
Borwein, P. (2002) · Springer eBooks · doi:10.1007/978-0-387-21652-2 · Cited by 135
Research works printed but not linked: 1
- Beenker, 1985, Binary sequences with a maximally flat amplitude spectrum, Philips J. Res., 40, 289
Cited by
Benchmarking in Optimization: Best Practice and Open Issues
Bartz-Beielstein, T., Doerr, C., Berg, D. V. D., Bossek, J., Chandrasekaran, S., Eftimov, T., Fischbach, A., Kerschke, P., La Cava, W., Lopez-Ibanez, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2007.03488 · Cited by 214
Challenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201
“For instance, to enable practical advantages, there should be a move away from relying on QRAM for designing quantum optimization algorithms with rigorous quantum speedups: although the QRAM model has led to elegant results, its physical realization remains a distant possibility at best.”
Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
Sanders, Y. R., Berry, D. W., Costa, P. C. S., Tessler, L. W., Wiebe, N., Gidney, C., Neven, H., & Babbush, R. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020312 · Cited by 103
Mathematical discovery and exploration can be done at scale
Georgiev, B., Gómez-Serrano, J., Tao, T., & Wagner, A. Z. (2026) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2536158123 · Cited by 161
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
“Second, the performance of classical solvers for LABS has been benchmarked (20, 21) in terms of the scaling of their TTS with problem size.”
BackgroundMethodInfluential
Metadata
- Authors
- Packebusch, T., & Mertens, S.
- Affiliations
- Otto-von-Guericke-Universität Magdeburg (DE)
- Santa Fe Institute (US)
- Corresponding author
- Mertens, Stephan
- ORCID
- Mertens, Stephan
- Venue
- Journal of Physics A: Mathematical and Theoretical
- Publisher
- IOP Publishing
- Published
- 2016-03-08
- Volume
- 49
- Issue
- 16
- Pages
- 165001
- ISSN
- 1751-8113 (ISSN-L)
- 1751-8121
- OpenAlex
- W2194947012
- Cited by
- 64
- References
- 22
- Citations by year
- 2026: 7 · 2025: 3 · 2024: 8 · 2023: 2 · 2022: 4 · 2021: 6 · 2020: 11 · 2019: 9 · 2018: 8 · 2017: 4 · 2016: 1
- FWCI
- 6.03
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- publishingsupport.iopscience.iop.org/iop-standard/v1 (vor)
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- Locations
- Journal of Physics A Mathematical and Theoretical (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Keywords
- low autocorrelation binary sequences, ground state, computational complexity, combinatorial optimization
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: Low autocorrelation binary sequences. https://app.cochat.ai/papers/10.1088/1751-8113/49/16/165001
- The paper
- Packebusch, T., & Mertens, S. (2016). Low autocorrelation binary sequences. Journal of Physics A: Mathematical and Theoretical. https://doi.org/10.1088/1751-8113/49/16/165001
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.