Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound

We give an explicit construction of length- $n$ binary codes capable of correcting the deletion of two bits that have size $2^{n}/n^{4+o(1)}$ . This matches up to lower order terms the existential result, based on an inefficient greedy choice of codewords,...