Publication:
On the covering radius of some modular codes

Simple item page
dc.contributor.affiliationDA-IICT, Gandhinagar
dc.contributor.authorGupta, Manish K
dc.contributor.authorDurairajan, Chinnappillai
dc.contributor.authorGupta, Manish K
dc.contributor.authorGupta, Manish K
dc.contributor.authorGupta, Manish K
dc.contributor.authorGupta, Manish K
dc.contributor.authorGupta, Manish K
dc.date.accessioned2025-08-01T13:09:06Z
dc.date.issued01-08-2014
dc.description.abstractThis paper gives lower and upper bounds on the covering radius of codes over�Z2s�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�Z4.
dc.format.extent129-137
dc.identifier.citationGupta, Manish K, and Chinnappillai Durairajan, "On the covering radius of some modular codes," Advances in Mathematics of Communications, vol. 8, no. 2, pp. 129-137, Aug. 2014. Doi: 10.3934/amc.2014.8.129
dc.identifier.doi10.3934/amc.2014.8.129
dc.identifier.issn1930-5338
dc.identifier.scopus2-s2.0-84900318006
dc.identifier.urihttps://ir.daiict.ac.in/handle/dau.ir/1641
dc.identifier.wosWOS:000336142900002
dc.language.isoen
dc.publisherAIMS
dc.relation.ispartofseriesVol. 8; No. 2
dc.sourceAdvances in Mathematics of Communications
dc.source.urihttps://www.aimsciences.org/article/doi/10.3934/amc.2014.8.129
dc.titleOn the covering radius of some modular codes
dspace.entity.typePublication
relation.isAuthorOfPublication77e93807-f5f8-431d-b312-6fa574541fc8
relation.isAuthorOfPublication77e93807-f5f8-431d-b312-6fa574541fc8
relation.isAuthorOfPublication.latestForDiscovery77e93807-f5f8-431d-b312-6fa574541fc8

Files

Collections

Journal Article