Polynomially larger deletion codes by linear hashing of substring counts

We show that binary codes of length $n$ correcting two deletions exist with redundancy $3\log_2n+O(\log_2\log_2n)$. The previous best upper bound had leading coefficient $4$, unchanged since 1965, while the best known lower bound has coefficient $2$. More generally, codes correcting $t\ge2$ deletion