Title of article
A remark on Haas’ method
Author/Authors
Plagne، نويسنده , , Alain، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
3318
To page
3322
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 K 2 ( 27 , 1 ) ≥ 4 794 174 .
Keywords
covering codes
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598823
Link To Document