| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649842 | Discrete Mathematics | 2009 | 5 Pages |
Abstract
We introduce a refinement in the method proposed some time ago by Haas for obtaining new lower bounds for the cardinality of codes with covering radius 1. As an application, we show that the minimal cardinality of a binary code in dimension 27 with covering radius 1 is at least K2(27,1)≥4794174.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Alain Plagne,