Lattice-like total perfect codes
From MaRDI portal
Publication:2442269
Recommendations
Cites work
- scientific article; zbMATH DE number 4070305 (Why is no real title available?)
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 617558 (Why is no real title available?)
- scientific article; zbMATH DE number 3405969 (Why is no real title available?)
- A generalization of Lee codes
- Abelian groups and packing by semicrosses
- Dominating sets in n‐cubes
- Efficient dominating sets in Cayley graphs.
- Factoring by subsets
- Graphs, Tessellations, and Perfect Codes on Flat Tori
- Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses
- On mosaics consisting of multidimensional crosses
- Packings of<tex>R^n</tex>by certain error spheres
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- Perfect domination in rectangular grid graphs
- Product Constructions for Perfect Lee Codes
- Quasi-Cross Lattice Tilings With Applications to Flash Memory
- Total perfect codes in grid graphs
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
- Total perfect codes in Cayley graphs
- Lattice Codes for Deletion and Repetition Channels
- 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)