Advances in the merit factor problem for binary sequences
Open accessThe DOI matches its Crossref record.
Abstract
The identification of binary sequences with large merit factor (small mean-squared aperiodic autocorrelation) is an old problem of complex analysis and combinatorial optimization, with practical importance in digital communications engineering and condensed matter physics. We establish the asymptotic merit factor of several families of binary sequences and thereby prove various conjectures, explain numerical evidence presented by other authors, and bring together within a single framework results previously appearing in scattered form. We exhibit, for the first time, families of skew-symmetric sequences whose asymptotic merit factor is as large as the best known value (an algebraic number greater than 6.34) for all binary sequences; this is interesting in light of [email protected]?s conjecture that the subclass of skew-symmetric sequences has asymptotically optimal merit factor. Our methods combine Fourier analysis, estimation of character sums, and estimation of the number of lattice points in polyhedra.
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
“We observe that as N grows, QAOA at p = 100 achieves an expected merit factor ⟨ C ⟩ MF of less than 5. we Note that explicit analytical sequences achieving merit factor > 6 are known (53).”
BackgroundLow 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
“org and for journal review theory [20, 21] are reported at values less than 7 – so the challenge of finding long sequences that would approach the asymptotic value for the maximum merit factor F = 12.”
Background
Metadata
- Authors
- Jedwab, J., Katz, D. J., & Schmidt, K.-U.
- Venue
- Journal of Combinatorial Theory, Series A
- Publisher
- Elsevier BV
- Published
- 2013-05
- Volume
- 120
- Issue
- 4
- Pages
- 882-906
- ISSN
- 0097-3165 (ISSN-L)
- OpenAlex
- W2066106400
- Cited by
- 36
- References
- 0
- FWCI
- 4.42
- 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: Advances in the merit factor problem for binary sequences. https://app.cochat.ai/papers/10.1016/j.jcta.2013.01.010
- The paper
- Jedwab, J., Katz, D. J., & Schmidt, K.-U. (2013). Advances in the merit factor problem for binary sequences. Journal of Combinatorial Theory, Series A. https://doi.org/10.1016/j.jcta.2013.01.010
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.