Packing points into a unit cube in higher space

MaRDI QIDQ3171650zbMATH OpenFDO

Authors Ákos G. Horváth

Publication date 5 October 2011

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

zbMATH Keywords

Hamming codespackingsunit cube

Mathematics Subject Classification ID

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

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.

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

Cited in

(8)

• Placing of points into the \(5\)-dimensional unit cube
• Hypercube packings and coverings with higher dimensional rooks
• Random sequential coding by Hamming distance
• scientific article; zbMATH DE number 7047830 (Why is no real title available?)
• scientific article; zbMATH DE number 3780 (Why is no real title available?)
• scientific article; zbMATH DE number 6470126 (Why is no real title available?)
• Primitive point packing
• \(L_1\)-norm packings from function fields

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)