On Codes over $\mathbb{Z}_{p^2}$ and its Covering Radius
N. Annamalai, C. Durairajan
TL;DR
This paper investigates the covering radius of codes over the ring Z_{p^2} under Lee distance, providing bounds and exact values for certain repetition codes, advancing understanding of code properties over this ring.
Contribution
It establishes bounds and exact covering radii for codes over Z_{p^2}, including specific repetition codes, which was previously not well understood.
Findings
Derived lower and upper bounds for covering radius over Z_{p^2}.
Determined the exact covering radius for various repetition codes.
Enhanced understanding of code performance under Lee distance over Z_{p^2}.
Abstract
This paper gives lower and upper bounds on the covering radius of codes over with respect to Lee distance. We also determine the covering radius of various Repetition codes over
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cooperative Communication and Network Coding