Perfect codes in Euclidean lattices

DOI10.1007/s40314-021-01436-3zbMath1476.94044OpenAlexW3133361158WikidataQ114219333 ScholiaQ114219333MaRDI QIDQ1983871

Sueli I. R. Costa, Giselle Strey, João Eloir Strapasson

Publication date: 10 September 2021

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-021-01436-3

zbMATH Keywords

latticeperfect codestilingspolyominoes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Lattice packing and covering (number-theoretic aspects) (11H31) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Polyominoes (05B50)

Related Items (1)

Perfect codes in two-dimensional algebraic lattices

Cites Work

• Unnamed Item
• Integral self-affine tiles in \(\mathbb{R}^n\). II: Lattice tilings
• Quasi-perfect codes in the \(\ell _p\) metric
• Fast decoding of quasi-perfect Lee distance codes
• Perfect codes in the \(\ell_p\) metric
• Lattice-tiling properties of integral self-affine functions
• Lattice tilings by cubes: Whole, notched and extended
• Counting lattice points in pyramids
• Nonexistence of perfect 2-error-correcting Lee codes in certain dimensions
• A generalization of Lee codes
• Lattice-like total perfect codes
• A new approach towards the Golomb-Welch conjecture
• Graphs, Tessellations, and Perfect Codes on Flat Tori
• There is but one PDS in $\mathbb{Z}^{3}$ inducing just square components
• Lattice Codes for Deletion and Repetition Channels
• Random Ensembles of Lattices From Generalized Reductions
• Integral Self-Affine Tiles in ℝ ⁿ I. Standard and Nonstandard Digit Sets
• Perfect Codes in the Lee Metric and the Packing of Polyominoes

This page was built for publication: Perfect codes in Euclidean lattices