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

摘要

A code is a collection of words or strings, not necessarily all of the same length, over come fixed alphabet. A relation is established between the insertion-and-deletion correcting capability of a code and its minimum distance for suitable Levenshtein-type distance measures.