arXiv · math/0110009
New upper bounds on sphere packings I
Abstract
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Henry Cohn, Noam Elkies. 2003-09-03. New upper bounds on sphere packings I. https://doi.org/10.4007/annals.2003.157.689
Cite the original work for its findings. Save a collection to share your selection of sources.