Perfect codes in the _p metric

DOI10.1016/J.EJC.2015.11.002zbMATH Open1330.94064arXiv1506.02517OpenAlexW578426344MaRDI QIDQ901156FDOQ901156

Authors: Antonio Campello, Grasiele C. Jorge, Sueli I. R. Costa, João E. Strapasson 

Publication date: 23 December 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/1506.02517

Recommendations

• Quasi-perfect codes in the \(\ell _p\) metric
• Perfect codes in Euclidean lattices
• The non-existence of some perfect codes over non-prime power alphabets
• On perfect poset codes
• Perfect codes in Cartesian products of 2-paths and infinite paths

Mathematics Subject Classification ID

Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cites Work

• A note on optimal unimodular lattices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New upper bounds on sphere packings. I
• On the non-existence of lattice tilings by quasi-crosses
• Quasi-Cross Lattice Tilings With Applications to Flash Memory
• Title not available (Why is that?)
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• A new approach towards the Golomb-Welch conjecture
• Constructive spherical codes near the Shannon bound
• An improvement to the Minkowski‐Hiawka bound for packing superballs

Cited In (18)

• Perfect codes in Euclidean lattices
• Perfect codes in the discrete simplex
• Partitions into perfect codes in the Hamming and Lee metrics
• Bounds for the \(l_1\)-distance of \(q\)-ary lattices obtained via constructions \(\mathrm D\), \(\mathrm D'\) and \(\overline{\mathrm D}\)
• On the non-existence of linear perfect Lee codes: the Zhang-Ge condition and a new polynomial criterion
• Title not available (Why is that?)
• Title not available (Why is that?)
• On lattice constructions \(D\) and \(D^\prime\) from \(q\)-ary linear codes
• Quasi-perfect codes in the \(\ell _p\) metric
• On perfect \(p\)-ary codes of length \(p+1\)
• Perfect codes in two-dimensional algebraic lattices
• Gluing and cutting cube tiling codes in dimension six
• Title not available (Why is that?)
• A new approach towards the Golomb-Welch conjecture
• On the structure of cube tiling codes
• A note on a flip-connected class of generalized domino tilings of the box \([0,2]^n\)
• Perfect codes and related structures
• Perfect codes for metrics generated by primitive 2-error-correcting binary BCH codes

This page was built for publication: Perfect codes in the \(\ell_p\) metric

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901156)