On the Covering Radius of Some Modular Codes

2016

This paper gives lower and upper bounds on the covering radius of codes over Z 2 s with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type α and Type β) and their dual and give bounds on the covering radii for MacDonald codes of both types over Z 4 .

International Journal on Information Theory, 2015

In this paper, we give lower and upper bounds on the covering radius of codes over the ring Z 4 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 Z 4 .

2015

In this correspondence, we give lower and upper bounds on the covering radius of codes over the ring R = Z2 + uZ2 where u2 = 0 with respect to different distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type α and Type β) and their dual and give bounds on the covering radius for MacDonald codes of both types over R.

arXiv (Cornell University), 2015

In this paper we define Z 2 Z 4 −Simplex and MacDonald Codes of type α and β and we give the covering radius of these codes.

2015

In this paper we define Z 2 Z 4 −Simplex and MacDonald Codes of type α and β and we give the covering radius of these codes.

International Journal on Information Theory, 2016

In this correspondence, we give lower and upper bounds on the covering radius of codes over the finite ring Z 6 with respect to different distances such as Hamming, Lee, Euclidean and Chinese Euclidean. We also determine the covering radius of various Block Repetition Codes over Z 6.

Mathematics, 2020

In this correspondence, we investigate the covering radius of various types of repetition codes over Z p k ( k ≥ 2 ) with respect to the Lee distance. We determine the exact covering radius of the various repetition codes, which have been constructed using the zero divisors and units in Z p k . We also derive the lower and upper bounds on the covering radius of block repetition codes over Z p k .

Open Journal of Discrete Applied Mathematics, 2019

In this paper, the covering radius of codes over R = Z 2 R * , where R * = Z 2 + vZ 2 , v 2 = v with different weight are discussed. The block repetition codes over R is defined and the covering radius for block repetition codes, simplex code of α-type and β-type in R are obtained.

Asian-European Journal of Mathematics

This paper gives lower and upper bounds on the covering radius of codes over [Formula: see text] with respect to Lee distance. We also determine the covering radius of various repetition codes over [Formula: see text]

2017

In this paper, we give lower and upper bounds on the covering radius of codes over the ring R = Z2 + uZ2, where u2 = 0 with bachoc distance and also obtain the covering radius of various Repetition codes, Simplex codes of α-Type code and β-Type code. We give bounds on the covering radius for MacDonald codes of both types over R = Z2 + uZ2. MSC: 20C05, 20C07, 94A05, 94A24.