Lattice-like total perfect codes
From MaRDI portal
Publication:2442269
DOI10.7151/DMGT.1715zbMATH Open1292.94181OpenAlexW2168025409MaRDI QIDQ2442269FDOQ2442269
Authors: Carlos A. G. jun. Araújo, Italo J. Dejter 
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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Cites Work
- Title not available (Why is that?)
- Dominating sets in n‐cubes
- Efficient dominating sets in Cayley graphs.
- Product Constructions for Perfect Lee Codes
- Total perfect codes in grid graphs
- Graphs, Tessellations, and Perfect Codes on Flat Tori
- Quasi-Cross Lattice Tilings With Applications to Flash Memory
- Title not available (Why is that?)
- Perfect domination in rectangular grid graphs
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- Title not available (Why is that?)
- Factoring by subsets
- On mosaics consisting of multidimensional crosses
- Title not available (Why is that?)
- Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses
- Packings of<tex>R^n</tex>by certain error spheres
- Abelian groups and packing by semicrosses
- A generalization of Lee codes
Cited In (8)
- Perfect codes in Euclidean lattices
- Subgroup total perfect codes in Cayley sum graphs
- Total perfect codes in graphs realized by commutative rings
- Perfect codes in two-dimensional algebraic lattices
- Rainbow perfect domination in lattice graphs
- Lattice Codes for Deletion and Repetition Channels
- Total perfect codes in Cayley graphs
- Lattice Index Coding
This page was built for publication: Lattice-like total perfect codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442269)
