Eyal En Gad

Polynomially larger deletion codes by linear hashing of substring counts

The result provides an edit-distance analogue of Varshamov's 1957 bound in the Hamming metric, both in the leading redundancy coefficient and in the role of linear independence in the proof.