On lower bounds for covering codes (Q1281409)
From MaRDI portal
!
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 1267606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On lower bounds for covering codes |
scientific article; zbMATH DE number 1267606 |
Statements
On lower bounds for covering codes (English)
0 references
18 September 2001
0 references
binary covering code
0 references
covering radius
0 references
sphere bound
0 references
lower bounds
0 references
minimum number of codewords
0 references
binary code
0 references
Hamming spheres
0 references
Hamming space
0 references
0.8910925984382629
0 references
0.8769890666007996
0 references
0.8756486177444458
0 references
0.8752978444099426
0 references
