On Codes over mathbb{Z}_(p²) and its Covering Radius
classification
💻 cs.IT
math.IT
keywords
codescoveringmathbbradiusboundsdeterminedistancegives
read the original abstract
This paper gives lower and upper bounds on the covering radius of codes over $\mathbb{Z}_{p^2}$ with respect to Lee distance. We also determine the covering radius of various Repetition codes over $\mathbb{Z}_{p^2}.$
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.