Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes
Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes
复制标题
DOI：
10.1109/itw54588.2022.9965935
复制
发表时间：
2020-09
期刊：
影响因子：
--
通讯作者：
Bernhard Haeupler;Amirbehshad Shahrasbi
中科院分区：
文献类型：
--
作者：
Bernhard Haeupler;Amirbehshad Shahrasbi
本文对列表插入码的最高成就率提出了一般界限，尤其是我们给出了新颖的外部和内部界限插入的部分和任何缺失的δ部分。
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.