# Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes

arXiv: https://arxiv.org/abs/1605.04611 · HTML: https://mlsanity.com/paper/1605.04611/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 May 2016.

## Built on by (most cited first, 1 of 1)

- [Edit Distance Robust Watermarks via Indexing Pseudorandom Codes](https://mlsanity.com/paper/2406.02633/) (2024)

## Abstract (arXiv)

This work constructs codes that are efficiently decodable from a constant fraction of worst-case insertion and deletion errors in three parameter settings: (i) Binary codes with rate approaching 1; (ii) Codes with constant rate for error fraction approaching 1 over fixed alphabet size; and (iii) Constant rate codes over an alphabet of size k for error fraction approaching (k-1)/(k+1). When errors are constrained to deletions alone, efficiently decodable codes in each of these regimes were constructed recently. We complete the picture by constructing similar codes that are efficiently decodable in the insertion/deletion regime.