roeder@unipas.fmi.uni-passau.de (Hans-Joachim Roeder) (11/06/90)
I'm looking for a formal definition of the Levenshtein distance of two codes. As far as I know, it's got something to do with the number of insertions and deletions you have to apply to one code word to transform it to another. Can anybody give me some hints where to find the exact definition? Thanks in advance. -- Hans-Joachim Roeder, University of Passau, Dep. of Math. & Comp. Sci., Germany roeder@unipas.fmi.uni-passau.de