New upper bounds on sphere packings I
Metric Geometry
2012-03-15 v3
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.
Cite
@article{arxiv.math/0110009,
title = {New upper bounds on sphere packings I},
author = {Henry Cohn and Noam Elkies},
journal= {arXiv preprint arXiv:math/0110009},
year = {2012}
}
Comments
26 pages, 1 figure