On the Covering Radius of Some Modular Codes

Manish. K. Gupta; C. Durairajan

On the Covering Radius of Some Modular Codes

Information Theory 2012-06-26 v2 math.IT Rings and Algebras

Authors: Manish. K. Gupta , C. Durairajan

Abstract

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$ .

Keywords

coding theory maximum distance separable code

Cite

@article{arxiv.1206.3038,
  title  = {On the Covering Radius of Some Modular Codes},
  author = {Manish. K. Gupta and C. Durairajan},
  journal= {arXiv preprint arXiv:1206.3038},
  year   = {2012}
}

Comments

revised

Related papers

View all related →