5 research outputs found
On Codes over and its Covering Radius
This paper gives lower and upper bounds on the covering radius of codes over
with respect to Lee distance. We also determine the covering
radius of various Repetition codes over $\mathbb{Z}_{p^2}.
On the Covering Radius of Some Modular Codes
This paper gives lower and upper bounds on the covering radius of codes over
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 .Comment: revise
On Some Classes of Linear Codes and their Covering Radius
In this paper we define Simplex and MacDonald
Codes of type and and we give the covering radius of these
codes.Comment: arXiv admin note: text overlap with arXiv:1411.1822 by other author
On Octonary Codes and their Covering Radii
This paper introduces new reduction and torsion codes for an octonary code
and determines their basic properties. These could be useful for the
classification of self-orthogonal and self dual codes over . We
also focus our attention on covering radius problem of octonary codes. In
particular, we determine lower and upper bounds of the covering radius of
several classes of Repetition codes, Simplex codes of Type and Type
and their duals, MacDonald codes, and Reed-Muller codes over
.Comment: 16 pages, some errors fixe
Simplex and MacDonald Codes over
In this paper, we introduce the homogeneous weight and homogeneous Gray map
over the ring for . We also
consider the construction of simplex and MacDonald codes of types and
over this ring