New upper bounds for binary covering codes (Q1377844)
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 1110090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New upper bounds for binary covering codes |
scientific article; zbMATH DE number 1110090 |
Statements
New upper bounds for binary covering codes (English)
0 references
26 January 1998
0 references
The authors consider upper bounds on \(K(n,r)\), the minimum cardinality of a binary code of length \(n\) and covering radius \(r\). Such bounds are obtained by constructing a corresponding covering code. The methods discussed are both combinatorial and based on computer search. The authors give an updated table of upper bounds on \(K(n,r)\), \(n\leq 64\), \(r\leq 12\).
0 references
upper bounds
0 references
minimum cardinality
0 references
binary code
0 references
covering radius
0 references
covering code
0 references
table
0 references
0 references
0 references
0.8716467022895813
0 references
0.8642385005950928
0 references
0.8562211990356445
0 references
0.8559646606445312
0 references
