Bounded Single Insertion/Deletion Correcting Codes

Abstract

A code is bounded single insertion/deletion correcting if a decoder corrects a single insertion or single deletion with side information about a range of positions occurring an inserted symbol or deleted symbol. This paper constructs two bounded single insertion/deletion correcting codes and gives decoding algorithms for these. Moreover, we evaluate the number of codewords of these codes. As a result, the constructed codes have larger cardinalities than the existing ones.