Arrow Research search
Back to STOC

STOC 2020

Optimally resilient codes for list-decoding from insertions and deletions

Conference Paper Session 4B: Coding and Information Theory Algorithms and Complexity · Theoretical Computer Science

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

  • Coding for Insertions and Deletions
  • List Decoding
  • Error Resilience

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
710741960206382767
v2026.09.13