We compute the covering radius of some families of binary cyclic codes. In particular, we compute the covering radius of cyclic codes with two zeros and minimum distance greater than 3. We compute the covering radius of some binary primitive BCH codes over F2f , where f = 7, 8.

In this paper, we give lower and upper bounds on the covering radius of codes over the ring Z4 with respect to chinese euclidean distance. We also determine the covering radius of various Repetition codes, Simplex codes Type α and Type β and give bounds on the covering radius for MacDonald codes of both types over Z4.

The results of this paper are concerned with the multi-covering radius, a generalization of covering radius, of Rank Distance (RD) codes. This leads to greater understanding of RD codes and their distance properties. Results on multi-covering radii of RD codes under various constructions are given by varying the parameters. Some bounds are established. A relationship between multi-covering radi...

We study the covering radius of sets of permutations with respect to the Hamming distance. Let f(n, s) be the smallest number m for which there is a set of m permutations in Sn with covering radius r ≤ n − s. We study f(n, s) in the general case and also in the case when the set of permutations forms a group. We find f(n, 1) exactly and bounds on f(n, s) for s > 1. For s = 2 our bounds are line...

In this paper, we restudy the covering radius of block codes from an information theoretic point of view by ignoring the combinatorial formulation of the problem. In the new setting, the formula of the statistically defined minimum covering radius, for which the probability mass of uncovered space by M spheres can be made arbitrarily small, is reduced to a minimization of a statistically define...