STOC 2020
Optimally resilient codes for list-decoding from insertions and deletions
Abstract
We give a complete answer to the following basic question: ”What is the maximal fraction of deletions or insertions tolerable by q -ary list-decodable codes with non-vanishing information rate?”
Authors
Keywords
Context
- Venue
- ACM Symposium on Theory of Computing
- Archive span
- 1969-2025
- Indexed papers
- 4364
- Paper id
- 710741960206382767