Insertion/deletion detecting codes were introduced by Konstantinidis et al. 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.
We propose the construction of a non-binary multiple insertion/deletion correcting code based on a binary multiple insertion/deletion correcting code. In essence, it is a generalisation of Tenengol'ts' non-binary single insertion/deletion correcting code. We evaluate the cardinality of the proposed construction based on the asymptotic upper bound on the cardinality of a maximal binary multiple insertion/deletion correcting code derived by Levenshtein.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.