Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes
Information Theory
2022-08-10 v2 Discrete Mathematics
Combinatorics
math.IT
Abstract
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 bounds simultaneously generalize the known bounds for the previously studied special cases of insertion-only, deletion-only, and zero-rate and correct other bounds that had been reported for the general case.
Cite
@article{arxiv.2009.13307,
title = {Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes},
author = {Bernhard Haeupler and Amirbehshad Shahrasbi},
journal= {arXiv preprint arXiv:2009.13307},
year = {2022}
}