combinatorics / Sequence design; aperiodic autocorrelation

The Barker-sequence conjecture: no Barker sequence of length greater than 13

Corollary 1.2: for n>1n>1, a Barker sequence of length nn exists if and only if n∈{2,3,4,5,7,11,13}n\in\{2,3,4,5,7,11,13\}. The new input is the even case, via the circulant Hadamard theorem; the odd case is the classical Turyn-Storer theorem. Section 5 records examples at every listed length. Nothing is claimed about nearly-Barker sequences or the asymptotic merit-factor problem.

30Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsSep 23, 2026Significance 30/100Registry: lean checked

The Barker-sequence conjecture: no Barker sequence of length greater than 13

Prior state unknown→proved

Corollary 1.2: for n>1n>1, a Barker sequence of length nn exists if and only if n∈{2,3,4,5,7,11,13}n\in\{2,3,4,5,7,11,13\}. The new input is the even case, via the circulant Hadamard theorem; the odd case is the classical Turyn-Storer theorem. Section 5 records examples at every listed length. Nothing is claimed about nearly-Barker sequences or the asymptotic merit-factor problem.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Corollary 1.2: for n>1n>1, a Barker sequence of length nn exists if and only if n∈{2,3,4,5,7,11,13}n\in\{2,3,4,5,7,11,13\}. The new input is the even case, via the circulant Hadamard theorem; the odd case is the classical Turyn-Storer theorem. Section 5 records examples at every listed length. Nothing is claimed about nearly-Barker sequences or the asymptotic merit-factor problem.

Corollary 1.2: for n>1n>1, a Barker sequence of length nn exists if and only if n∈{2,3,4,5,7,11,13}n\in\{2,3,4,5,7,11,13\}. The new input is the even case, via the circulant Hadamard theorem; the odd case is the classical Turyn-Storer theorem. Section 5 records examples at every listed length. Nothing is claimed about nearly-Barker sequences or the asymptotic merit-factor problem.

Recorded attempts

Evidence graph

Connected research record

The Barker-sequence conjecture: no Barker sequence of length greater than 13 — Mathematical Frontier Network