Title :
A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes
Author :
Hollmann, Henk D L
Author_Institution :
Philips Res. Lab., Eindhoven, Netherlands
fDate :
7/1/1993 12:00:00 AM
Abstract :
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
Keywords :
error correction codes; Levenshtein-type distances; codes; insertion-and-deletion correcting capability; minimum distance; Error correction codes; Notice of Violation; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
