On Codes over ℤ_p² and its Covering Radius

2017/11/06 by N. Annamalai, Annamalai, N., C. Durairajan +1
Computer Science · Engineering · #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1711.01803

openalex publication_date 2017/11/06 · 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 ℤ_p² with respect to Lee distance. We also determine the covering radius of various Repetition codes over ℤ_p².

Related

• On the Covering Radius of Some Modular Codes
• On Some Classes of ℤ₂ℤ₄-Linear Codes and their Covering Radius
• On covering radius of generalized Zetterberg codes
• Bounds on MLDR Codes Over \mathbb Z_p^t
• On the covering radius of small codes versus dual distance