For every small eta, explicit binary linear list-decodable codes correct an eta fraction of insertions and deletions with rate 1-O(eta^(1/4)) and polynomial-time encoding and decoding.
Deterministic document exchange protocols, and almost optimal binary codes for edit errors,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$
For every small eta, explicit binary linear list-decodable codes correct an eta fraction of insertions and deletions with rate 1-O(eta^(1/4)) and polynomial-time encoding and decoding.