Title of article
An improved lower bound on the covering number K2(9, 1) Original Research Article
Author/Authors
E. Kolev، نويسنده , , R. Hill، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
7
From page
483
To page
489
Abstract
In this article we improve the lower bound for K2(9, 1), the minimum cardinality of a binary code of length 9 and covering radius 1. We show that a binary code of length 9, 55 codewords and covering radius 1 does not exist which gives a new lower bound K2(9, 1) ⩾ 56.
Keywords
Lower bound , Covering number , Codeword
Journal title
Discrete Mathematics
Serial Year
1999
Journal title
Discrete Mathematics
Record number
950728
Link To Document