Codes Correcting Two Deletions

In this paper, we investigate the problem of constructing codes capable of correcting two deletions. In particular, we construct a code that requires redundancy approximately 8 log
₂
n + O(log
₂
log
₂
n) bits of redundancy, where n denotes the length of the code. To the best of the authors' knowledge, this represents the best known construction in that it requires the lowest number of redundant bits for a code correcting two deletions.