On tilings of the binary vector space

DOI10.1016/0012-365X(80)90138-7zbMath0452.05018OpenAlexW2055684051MaRDI QIDQ1148323

Gérard D. Cohen, Peter Frankl

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0012-365x(80)90138-7

zbMATH Keywords

perfect codesmaximal cliquesHamming space

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

On identifying codes in binary Hamming spaces

Cites Work

• Weight distribution of translates, covering radius, and perfect codes correcting errors of given weights
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On tilings of the binary vector space