Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces

DOI10.1137/S0895480104435804zbMath1075.05001OpenAlexW1969744767MaRDI QIDQ4652644

Alexander Vardy, Patric R. J. Östergård

Publication date: 28 February 2005

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

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

zbMATH Keywords

charactersperfect codesexact cover

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial aspects of tessellation and tiling problems (05B45) Combinatorial codes (94B25) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (12)

ELEMENTARY p-GROUPS WITH THE RÉDEI PROPERTY ⋮ On the classification of perfect codes: side class structures ⋮ An enumeration of 1-perfect ternary codes ⋮ On the Number of Neighbors in Normal Tiling ⋮ NONQUASI-PERIODIC FACTORIZATIONS FOR CERTAIN FINITE ABELIAN GROUPS ⋮ SMALL p-GROUPS WITH FULL-RANK FACTORIZATION ⋮ On perfect binary codes ⋮ A remark on full rank perfect codes ⋮ Full-rank factorings of elementary \(p\)-groups by \(Z\)-subsets. ⋮ Full rank perfect codes and \(\alpha \)-kernels ⋮ On rank and kernel of some mixed perfect codes ⋮ QUASI-PERIODIC FACTORIZATIONS

This page was built for publication: Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces