Polynomially larger deletion codes by linear hashing of substring counts

Eyal En Gad

We reduce the leading redundancy coefficient for binary codes correcting any fixed number $t\ge 2$ of deletions from $2t$ to $2t-1$. This is the first improvement to that coefficien…