A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes.

Henk D. L. Hollmann A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes. 1424-1427 1993 39 IEEE Transactions on Information Theory 4 db/journals/tit/tit39.html#Hollmann93 http://dx.doi.org/10.1109/18.243463