Complexity of Elias algorithm based on codes with covering radius three (Q2932869)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6378849
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Elias algorithm based on codes with covering radius three |
scientific article; zbMATH DE number 6378849 |
Statements
9 December 2014
0 references
nearest neighbors
0 references
best match
0 references
Eleas algorithm
0 references
hash functions
0 references
quasiperfect codes
0 references
uniformly packed codes
0 references
coset weight distribution
0 references
0.7316485643386841
0 references
0.7269591093063354
0 references
0.7125838398933411
0 references
0.7063868045806885
0 references
