A remark on Haas' method (Q1025956)
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 remark on Haas' method |
scientific article; zbMATH DE number 5569078
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A remark on Haas' method |
scientific article; zbMATH DE number 5569078 |
Statements
A remark on Haas' method (English)
0 references
23 June 2009
0 references
The minimum cardinality of a binary code of length \(n\) and covering radius \(R\) is denoted by \(K(n,R)\). The author refines a method by \textit{W. Haas} [Discrete Math. 256, No. 1--2, 161--178 (2002; Zbl 1013.94039)] for obtaining lower bounds on \(K(n,1)\). The results include one specific new bound, \(K(27,1) \geq 4794174\).
0 references
covering code
0 references
lower bound
0 references
0 references
0 references
0 references
