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

From MaRDI portal