The existence of the perfect deletion code with mixed length {4,5,6} (Q2992091)
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: The existence of the perfect deletion code with mixed length {4,5,6} |
scientific article; zbMATH DE number 6610991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The existence of the perfect deletion code with mixed length {4,5,6} |
scientific article; zbMATH DE number 6610991 |
Statements
10 August 2016
0 references
Levenshtein distance
0 references
perfect deletion error-correcting code
0 references
directed pair-wise balanced design
0 references
0.8873652219772339
0 references
0.8763547539710999
0 references
0.8460374474525452
0 references
0.8460374474525452
0 references
0.8380663394927979
0 references
