On the packing radius and the covering radius of equal-weight codes (Q1970698)

The authors find the exact value of the packing radius of a well-known equal-weight code. They give the upper and lower bounds for this code's covering radius. Also the aspect of constructivity and complexity is discussed. In particular, the authors describe an efficient (polynomial) procedure that finds for each word of weight \(k\) (= the weight of all codewords) some codeword at distance less than the upper bound of the covering radius obtained in this paper.