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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.