On multiple insertion/deletion correcting codes

We investigate binary, number-theoretic, bit insertion/deletion correcting codes as pioneered by Levenshtein (1965, 1966, 1989). The weight spectra and Hamming distance properties of single insertion/deletion error-correcting codes are analyzed. These relationships are then extended to investigate codes that can correct multiple random insertions and deletions. From these relationships, new bounds are derived and a general construction for multiple insertion/deletion correcting codes is proposed and evaluated.