A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
On multiple insertion/deletion correcting codes
2002
IEEE Transactions on Information Theory
Preserved Fulltext
We investigate binary, number-theoretic, bit insertion/deletion correcting codes as pioneered by Levenshtein. 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.
doi:10.1109/18.971760
fatcat:3axt3lo3tjf6pglfennpp7rabu