2 problems

Let ${\bf C}$ be a Reed–Solomon code of length $n$ and dimension $k$, and let $d_{insdel}$ denote its insertion-deletion distance. Reed–Solomon insdel-distance upper-bound conjectu…

Optimal binary linear insertion-deletion code conjecture. If $n>2k$, $\mathbf{1}\notin\mathcal C$, and $\mathcal C$ is optimal with respect to the strict half-Singleton bound, then…