On an algebraic method for bounding the covering radius (Q2717207)

The purpose of this paper is to derive a new bound on the covering radius of a block code. This upper bound is better than the known ones when the value of the normalized dual distance is not too large. There are only two known results in such a situation. The approach of this paper is a refinement of the method given in a paper in 1999 in which the present author is one of the contributors, and the current method is also somewhat simpler. The bound improves on the known estimates on the covering radius in a certain interval. The improvement is based on a better estimate for the cardinality of a constant weight code.NEWLINENEWLINEFor the entire collection see [Zbl 0960.00079].