论文标题
可列出的插入插入码代码的率距离权衡取舍
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 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.
