Insertion/Deletion Detecting Codes and the Boundary Problem

Autor:	Khaled Abdel-Ghaffar, Hendrik C. Ferreira, Filip Paluncic
Rok vydání:	2013
Předmět:	Block code Concatenated error correction code Boundary problem Code word Reed–Muller code Library and Information Sciences Linear code Computer Science Applications Data_FILES Code (cryptography) Arithmetic Algorithm Decoding methods Information Systems Mathematics
Zdroj:	IEEE Transactions on Information Theory. 59:5935-5943
ISSN:	1557-9654 0018-9448
DOI:	10.1109/tit.2013.2264825
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::3d71d5d09933cf1f40fe99e08f8ee27f https://doi.org/10.1109/tit.2013.2264825 Zobrazit plný text záznamu