Abstract
We introduce the notion of degree of imperfection of a code in \(\mathbb {Z}^n\) with the \(\ell _p\) metric, to extend the so-called quasi-perfect codes. Through the establishment of bounds and computational approach, we determine all radii for which there are linear quasi-perfect codes for \(p = 2\) and \(n = 2, 3\). Numerical results concerning the codes with small degree of imperfection are also presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
