Author/Authors :
Plagne، نويسنده , , Alain، نويسنده ,
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 .
