A generalization of Lee codes
From MaRDI portal
Publication:2436575
DOI10.1007/s10623-012-9666-6zbMath1282.05177arXiv1210.5863OpenAlexW2038908882MaRDI QIDQ2436575
Italo Jose Dejter, Peter Horák, Carlos A. G. jun. Araújo
Publication date: 25 February 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.5863
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Related Items (6)
A new approach towards the Golomb-Welch conjecture ⋮ Perfect codes in two-dimensional algebraic lattices ⋮ Lattice-like total perfect codes ⋮ \([1,2\)-sets in graphs] ⋮ Perfect codes in Euclidean lattices ⋮ Rainbow perfect domination in lattice graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses
- Perfect distance-\(d\) placements in 2D toroidal networks
- Abelian groups and packing by semicrosses
- Fast decoding of quasi-perfect Lee distance codes
- Lectures on advances in combinatorics
- Efficient dominating sets in Cayley graphs.
- Factoring by subsets
- Tilings by $(0.5,n)$-Crosses and Perfect Codes
- Packings of<tex>R^n</tex>by certain error spheres
- Graphs, Tessellations, and Perfect Codes on Flat Tori
- Perfect domination in rectangular grid graphs
- On mosaics consisting of multidimensional crosses
- Dominating sets in n‐cubes
- Quasi-perfect Lee distance codes
- Quasi-Cross Lattice Tilings With Applications to Flash Memory
- Product Constructions for Perfect Lee Codes
- Perfect domination in regular grid graphs
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- On perfect codes and related concepts
This page was built for publication: A generalization of Lee codes
