On the Covering Radius of Some Modular Codes

2012/06/14 by Manish K. Gupta, Gupta, Manish. K., C. Durairajan +1
Computer Science · Engineering · Mathematics · #94B25 (Primary) 11H31 (Secondary) #Coding theory and cryptography #FOS: Computer and information sciences #FOS: Mathematics #Finite Group Theory Research #Information Theory (cs.IT) #Rings and Algebras (math.RA) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1206.3038

openalex publication_date 2012/06/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 α and Type β) and their dual and give bounds on the covering radii for MacDonald codes of both types over \Z₄.

Related

• On Codes over ℤ_p² and its Covering Radius
• On Some Classes of ℤ₂ℤ₄-Linear Codes and their Covering Radius
• On Octonary Codes and their Covering Radii
• The Covering Radius of the Reed--Muller Code RM(2,7) is 40
• On covering radius of generalized Zetterberg codes