On the covering radius of some modular codes

From MaRDI portal
Publication:476335

DOI10.3934/AMC.2014.8.129zbMATH Open1300.94126arXiv1206.3038OpenAlexW2962917683MaRDI QIDQ476335FDOQ476335


Authors: M. K. Gupta, Chinnappillai Durairajan Edit this on Wikidata


Publication date: 28 November 2014

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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


Full work available at URL: https://arxiv.org/abs/1206.3038




Recommendations




Cites Work


Cited In (12)





This page was built for publication: On the covering radius of some modular codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476335)