2 problems

Turyn's conjecture on the nonexistence of long Barker sequences
arXiv@arxiv
A Barker sequence is a binary sequence for which every nontrivial aperiodic autocorrelation has magnitude at most $1$ . Turyn's conjecture. There is no Barker sequence of length gre…
Conjectureopenautocorrelation barker-sequences coding-theory
1
The nonexistence conjecture for long Barker sequences
arXiv@arxiv
Let $a_1,\ldots,a_n$ be a Barker sequence: each $a_i\in\{\pm1\}$ and its aperiodic autocorrelations $c_k=\sum_{i=1}^{n-k}a_i a_{i+k}$ satisfy $|c_k|\leq1$ for every $k\geq1$ . Barke…
Conjectureopenautocorrelation barker-sequences combinatorial-designs
0

Turyn's conjecture on the nonexistence of long Barker sequences