Lattice-like total perfect codes
From MaRDI portal
Publication:2442269
DOI10.7151/dmgt.1715zbMath1292.94181OpenAlexW2168025409MaRDI QIDQ2442269
Italo Jose Dejter, Carlos A. G. jun. Araújo
Publication date: 2 April 2014
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1715
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Related Items (5)
Total perfect codes in Cayley graphs ⋮ Perfect codes in two-dimensional algebraic lattices ⋮ Perfect codes in Euclidean lattices ⋮ Unnamed Item ⋮ Rainbow perfect domination in lattice graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses
- Abelian groups and packing by semicrosses
- Fast decoding of quasi-perfect Lee distance codes
- Efficient dominating sets in Cayley graphs.
- A generalization of Lee codes
- Factoring by subsets
- 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-Cross Lattice Tilings With Applications to Flash Memory
- Product Constructions for Perfect Lee Codes
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
This page was built for publication: Lattice-like total perfect codes
