Covering and packing problems in lattices associated with the \(n\)-cube

DOI10.1006/eujc.2001.0543zbMath1008.52016OpenAlexW2063036724MaRDI QIDQ1348769

Horst Martini, Walter Wenzel

Publication date: 10 April 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2001.0543

zbMATH Keywords

\(n\)-cubeoptimal coverings of lattices

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unit sphere packings and coverings of the Hamming space
• Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
• The Hadamard Maximum Determinant Problem
• Hyperplane arrangements separating arbitrary vertex classes in \(n\)-cubes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item