Packings with large minimum kissing numbers

DOI10.1016/S0012-365X(97)00071-XzbMath0894.52008OpenAlexW2068065014MaRDI QIDQ1377762

Noga Alon

Publication date: 7 September 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00071-x

zbMATH Keywords

kissing numbererror correcting codenon-lattice packing

Mathematics Subject Classification ID

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

Related Items (4)

Contact graphs of ball packings ⋮ On limits of graphs sphere packed in Euclidean space and applications ⋮ Ball packings with high chromatic numbers from strongly regular graphs ⋮ On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)

Cites Work

• Unnamed Item
• Some extreme forms defined in terms of Abelian groups
• Further lattice packings in high dimensions
• Simple Constructions of Almost k-wise Independent Random Variables
• The Optimal Lattice Quantizer in Three Dimensions
• Some Sphere Packings in Higher Space

This page was built for publication: Packings with large minimum kissing numbers