English

Perfect codes in the lp metric

Combinatorics 2015-11-11 v2 Information Theory math.IT

Abstract

We investigate perfect codes in Zn\mathbb{Z}^n under the p\ell_p metric. Upper bounds for the packing radius rr of a linear perfect code, in terms of the metric parameter pp and the dimension nn are derived. For p=2p = 2 and n=2,3n = 2, 3, we determine all radii for which there are linear perfect codes. The non-existence results for codes in Zn\mathbb{Z}^n presented here imply non-existence results for codes over finite alphabets Zq\mathbb{Z}_q, when the alphabet size is large enough, and has implications on some recent constructions of spherical codes.

Keywords

Cite

@article{arxiv.1506.02517,
  title  = {Perfect codes in the lp metric},
  author = {Antonio Campello and Grasiele C. Jorge and and João Strapasson and Sueli I. R. Costa},
  journal= {arXiv preprint arXiv:1506.02517},
  year   = {2015}
}

Comments

21 pages, 9 figures, minor corrections, accepted for publication European Journal of Combinatorics

R2 v1 2026-06-22T09:49:17.806Z