Packing points into a unit cube in higher space

zbMATH Open1242.52020arXiv0910.0937MaRDI QIDQ3171650FDOQ3171650

Authors: Ákos G. Horváth 

Publication date: 5 October 2011

Abstract: In this paper using the concept of the extended Hamming code we give a construction for dense packing of points at distance at least one in such unit cubes which dimension are a power of two.

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

Recommendations

• scientific article; zbMATH DE number 5593210
• scientific article; zbMATH DE number 6470126
• CUBE PACKINGS IN EUCLIDEAN SPACES
• Packing cubes into a cube in \((D>3)\)-dimensions
• scientific article; zbMATH DE number 3955884
• Packing the hypercube
• Packing-constrained point coverings
• Multidimensional cube packing
• Multidimensional cube packing
• scientific article; zbMATH DE number 797898

zbMATH Keywords

packingsHamming codesunit cube

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Linear codes (general theory) (94B05)

Cited In (6)

• Placing of points into the \(5\)-dimensional unit cube
• \(L_1\)-norm packings from function fields
• Primitive point packing
• Random sequential coding by Hamming distance
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Packing points into a unit cube in higher space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171650)