Insertion/Deletion Detecting Codes and the Boundary Problem
Insertion/Deletion Detecting Codes and the Boundary Problem
复制标题
插入/删除检测码和边界问题
DOI：
--
复制
发表时间：
2013
影响因子：
2.5
通讯作者：
H. C. Ferreira
中科院分区：
文献类型：
--
作者：
F. Palunčić;K. Abdel;H. C. Ferreira
插入/删除检测码由Konstantinidis提出，本文对插入/删除检测码的定义略有不同，并在此基础上引入了多次删除和多次插入检测码。结果表明，这些系统码是最优的，因为没有其他系统的多次删除（插入）检测码具有更好的检测率。用于纠正插入/删除错误的数论代码结构（例如Levenshtein代码）的局限性之一是，为了成功解码，它们需要知道接收的码字边界。在文献中，已经提出了许多方案来处理这个问题。我们展示了本文中提出的插入/删除检测代码如何用于改进和/或扩展其中的一些方案。
Insertion/deletion detecting codes were introduced by Konstantinidis In this paper we define insertion/deletion detecting codes in a slightly different manner, and based on this definition, we introduce multiple deletion and multiple insertion detecting codes. It is shown that these codes, which are systematic, are optimal in the sense that there exists no other systematic multiple deletion (insertion) detecting codes with a better rate. One of the limitations of number-theoretic code constructions intended to correct insertion/deletion errors, e.g., the Levenshtein code, is that they require received codeword boundaries to be known in order to successfully decode. In literature, a number of schemes have been proposed to deal with this problem. We show how insertion/deletion detecting codes as presented in this paper can be used to improve and/or extend some of these schemes.