CoChat

Low autocorrelation binary sequences

Open access
Packebusch, Tom, Mertens, Stephan · 2016 · Journal of Physics A: Mathematical and Theoretical

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/1751-8113/49/16/165001

Cites

24 of 24 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

2 more claims about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

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

Show all 24 references

Research works printed but not linked: 1

  1. Beenker, 1985, Binary sequences with a maximally flat amplitude spectrum, Philips J. Res., 40, 289

Cited by

See all 104

Metadata

Authors
Packebusch, T., & Mertens, S.
Affiliations
  • Otto-von-Guericke-Universität Magdeburg (DE)
  • Santa Fe Institute (US)
Corresponding author
Mertens, Stephan
Venue
Journal of Physics A: Mathematical and Theoretical
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
Licence
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.