A RELATION BETWEEN LEVENSHTEIN-TYPE DISTANCES AND INSERTION-AND-DELETION CORRECTING CAPABILITIES OF CODES

Authors
HOLLMANN HDL
Citation
Hdl. Hollmann, A RELATION BETWEEN LEVENSHTEIN-TYPE DISTANCES AND INSERTION-AND-DELETION CORRECTING CAPABILITIES OF CODES, IEEE transactions on information theory, 39(4), 1993, pp. 1424-1427
Citations number
8
Categorie Soggetti
Mathematics,"Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
39
Issue
4
Year of publication
1993
Pages
1424 - 1427
Database
ISI
SICI code
0018-9448(1993)39:4<1424:ARBLDA>2.0.ZU;2-R
Abstract
A code is a collection of words (strings), not necessarily all of the same length, over some fixed alphabet A relation is established betwee n the insertion-and-deletion correcting capability of a code and its m inimum distance, for suitable Levenshtein-type distance measures.