Logarithmically larger deletion codes of all distances

Noga Alon, Gabriela Bourla, Ben Graham +2

The deletion distance between two binary words $u,v\in \{0,1{\}}^n$ is the smallest $k$ such that $u$ and $v$ share a common subsequence of length $n-k$. A set $C$ of binary words o…