Perfect codes in the lp metric
Combinatorics
2015-11-11 v2 Information Theory
math.IT
Abstract
We investigate perfect codes in under the metric. Upper bounds for the packing radius of a linear perfect code, in terms of the metric parameter and the dimension are derived. For and , we determine all radii for which there are linear perfect codes. The non-existence results for codes in presented here imply non-existence results for codes over finite alphabets , 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