Tilings of Binary Spaces

DOI10.1137/S0895480195280137zbMath0865.05032OpenAlexW2009917512MaRDI QIDQ4895630

Gilles Zémor, Alexander Vardy, Simon N. Litsyn, Gérard D. Cohen

Publication date: 20 November 1996

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

Full work available at URL: https://doi.org/10.1137/s0895480195280137

zbMATH Keywords

tessellationhypercubeperfect binary codefactorizationtilingHamming spacefinite graphsLloyd theoremfull-rank tilings

Mathematics Subject Classification ID

Partitions of sets (05A18) Other types of codes (94B60) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Combinatorial aspects of tessellation and tiling problems (05B45) Combinatorial codes (94B25)

Related Items (10)

ELEMENTARY p-GROUPS WITH THE RÉDEI PROPERTY ⋮ On the classification of perfect codes: side class structures ⋮ Tiling Hamming space with few spheres ⋮ An enumeration of 1-perfect ternary codes ⋮ Projective tilings and full-rank perfect codes ⋮ SMALL p-GROUPS WITH FULL-RANK FACTORIZATION ⋮ Linear maps of perfect codes and irregular \(C\)-partitions ⋮ A remark on full rank perfect codes ⋮ Full-rank factorings of elementary \(p\)-groups by \(Z\)-subsets. ⋮ Full rank perfect codes and \(\alpha \)-kernels

This page was built for publication: Tilings of Binary Spaces