An improved lower bound on the covering number \(K_2(9,1)\) (Q1292854): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Covering radius 1985-1994 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New binary covering codes obtained by simulated annealing / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(99)90103-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4210509915 / rank | |||
Normal rank | |||
Latest revision as of 10:36, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved lower bound on the covering number \(K_2(9,1)\) |
scientific article |
Statements
An improved lower bound on the covering number \(K_2(9,1)\) (English)
0 references
6 April 2000
0 references
Here the authors improve the lower bound for \(K_2(9,1)\), the minimum cardinality of a binary code of length 9 and covering radius 1 in showing that a binary code of length 9, 55 codewords and covering radius 1 does not exist giving the new lower bound \(K_2(9,1)\geq 56\). In a later paper they obtain the bound 57 (see the following review Zbl 0933.94040). The best upper bound \(K(9)\leq 62\) has been obtained by L. T. Wille.
0 references
minimum cardinality
0 references
binary code
0 references
covering radius
0 references
