On Codes over Zp2\mathbb{Z}_{p^2} and its Covering Radius

This paper gives lower and upper bounds on the covering radius of codes over $\mathbb{Z}_{p^2}$ with respect to Lee distance. We also determine the covering radius of various Repetition codes over $\mathbb{Z}_{p^2}.

On the ZqZ_q-MacDonald Code and its Weight Distribution of dimension 3

In this paper, we determine the parameters of $\mathbb{Z}_q$-MacDonald Code of dimension k for any positive integer $q \geq 2.$ Further, we have obtained the weight distribution of $\mathbb{Z}_q$-MacDonald code of dimension 3 and furthermore, we have given the weight distribution of $\mathbb{Z}_q$-Simplex code of dimension 3 for any positive integer $q \geq 2.

On the Covering Radius of Some Modular Codes

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 $\alpha$ and Type $\beta$) and their dual and give bounds on the covering radii for MacDonald codes of both types over $\Z_4$.Comment: revise

On Some Classes of Z2Z4−\mathbb{Z}_{2}\mathbb{Z}_{4}-Linear Codes and their Covering Radius

In this paper we define $\mathbb{Z}_{2}\mathbb{Z}_{4}-$Simplex and MacDonald Codes of type $\alpha$ and $\beta$ and we give the covering radius of these codes.Comment: arXiv admin note: text overlap with arXiv:1411.1822 by other author

On DNA Codes using the Ring Z4 + wZ4

In this work, we study the DNA codes from the ring R = Z4 + wZ4, where w^2 = 2+2w with 16 elements. We establish a one to one correspondence between the elements of the ring R and all the DNA codewords of length 2 by defining a distance-preserving Gau map phi. Using this map, we give several new classes of the DNA codes which satisfies reverse and reverse complement constraints. Some of the constructed DNA codes are optimal.Comment: Revised version with new results and corrections. Submitted to ISIT 201