Tilings by $(0.5,n)$-Crosses and Perfect Codes

DOI10.1137/110839916zbMath1272.05023arXiv1107.5706OpenAlexW2007086773MaRDI QIDQ2848555

Sarit Buzaglo, Tuvi Etzion

Publication date: 26 September 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.5706

zbMATH Keywords

tilingperfect codesemicrossperfect dominating settiling by cross

Mathematics Subject Classification ID

Lattice packing and covering (number-theoretic aspects) (11H31) Combinatorial aspects of tessellation and tiling problems (05B45) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Relations with coding theory (11H71)

Related Items (3)

On the Number of Neighbors in Normal Tiling ⋮ A generalization of Lee codes ⋮ Rainbow perfect domination in lattice graphs

This page was built for publication: Tilings by $(0.5,n)$-Crosses and Perfect Codes