A remark on Haas' method (Q1025956): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.09.042 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064613794 / rank | |||
Normal rank | |||
Revision as of 03:15, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A remark on Haas' method |
scientific article |
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
