加载中…
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 $n = 2, 3$, 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本