A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes (Q4307351)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes |
scientific article; zbMATH DE number 645382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes |
scientific article; zbMATH DE number 645382 |
Statements
A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes (English)
0 references
4 October 1994
0 references
insertion-and-deletion correcting code
0 references
Levenshtein distance
0 references
0.842330813407898
0 references
0.841993510723114
0 references
0.8076814413070679
0 references
0.7827050685882568
0 references
