Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes
Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes
This paper presents general bounds on the highest achievable rate for list-decodable insertion-deletion codes. In particular, we give novel outer and inner bounds for the highest achievable communication rate of any insertion-deletion code that can be list-decoded from any γ fraction of insertions and any δ fraction of deletions. Our …