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. >
[1] J. Kruskal. An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules , 1983 .
[2] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .
[3] Eiichi Tanaka,et al. Synchronization and substitution error-correcting codes for the Levenshtein metric , 1976, IEEE Trans. Inf. Theory.
[4] G. Tenengolts,et al. Nonbinary codes, correcting single deletion or insertion , 1984, IEEE Trans. Inf. Theory.