论文标题
非二进制代码，用于纠正最多删除的爆发
Non-binary Codes for Correcting a Burst of at Most t Deletions
论文作者
论文摘要
纠正缺失的问题受到了极大的关注，部分原因是DNA数据存储中这些错误的普遍性。在本文中，我们研究了以非二进制序列最多纠正最多$ t $删除的连续爆发的问题。我们首先提出了一个非二进制代码，以$ q $ -ary字母纠正最多2个删除。之后，我们将此结果扩展到爆发的长度最多可以是$ t $的情况下，其中$ t $是一个常数。最后，我们考虑传输序列的设置为排列。所提出的代码以其各自的参数制度而闻名。
The problem of correcting deletions has received significant attention, partly because of the prevalence of these errors in DNA data storage. In this paper, we study the problem of correcting a consecutive burst of at most $t$ deletions in non-binary sequences. We first propose a non-binary code correcting a burst of at most 2 deletions for $q$-ary alphabets. Afterwards, we extend this result to the case where the length of the burst can be at most $t$ where $t$ is a constant. Finally, we consider the setup where the sequences that are transmitted are permutations. The proposed codes are the largest known for their respective parameter regimes.
