Efficient Low-Redundancy Codes for Correcting Multiple Deletions

TL;DR

This paper introduces explicit binary codes with low redundancy that can efficiently correct multiple deletions, extending the well-understood single deletion case to fixed small k, with near-optimal redundancy and decoding time.

Contribution

We construct explicit binary codes for fixed k deletions with near-optimal redundancy and efficient decoding, improving upon previous non-constructive bounds for multiple deletions.

Findings

Redundancy is $O(k^2 \, \log k \log n)$ for fixed k.

Decoding complexity is $O_k(n \log^4 n)$.

Codes can be adapted to handle insertions and deletions.

Abstract

We consider the problem of constructing binary codes to recover from $k$-bit deletions with efficient encoding/decoding, for a fixed $k$. The single deletion case is well understood, with the Varshamov-Tenengolts-Levenshtein code from 1965 giving an asymptotically optimal construction with $\approx 2^n/n$ codewords of length $n$, i.e., at most $\log n$ bits of redundancy. However, even for the case of two deletions, there was no known explicit construction with redundancy less than $n^{\Omega(1)}$. For any fixed $k$, we construct a binary code with $c_k \log n$ redundancy that can be decoded from $k$ deletions in $O_k(n \log^4 n)$ time. The coefficient $c_k$ can be taken to be $O(k^2 \log k)$, which is only quadratically worse than the optimal, non-constructive bound of $O(k)$. We also indicate how to modify this code to allow for a combination of up to $k$ insertions and deletions.