Barker sequences of odd length
Kai-Uwe Schmidt, J\"urgen Willms

TL;DR
This paper presents a new, simpler proof confirming that Barker sequences of odd length greater than 13 do not exist, supporting Turyn's longstanding conjecture.
Contribution
The authors provide a more straightforward proof of Turyn's conjecture regarding the nonexistence of odd-length Barker sequences longer than 13.
Findings
No odd-length Barker sequences longer than 13 exist
The proof simplifies previous complex arguments
Supports Turyn's conjecture with a new approach
Abstract
A Barker sequence is a binary sequence for which all nontrivial aperiodic autocorrelations are at most 1 in magnitude. An old conjecture due to Turyn asserts that there is no Barker sequence of length greater than 13. In 1961, Turyn and Storer gave an elementary, though somewhat complicated, proof that this conjecture holds for odd lengths. We give a new and simpler proof of this result.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · semigroups and automata theory
