Journal
ANNALS OF MATHEMATICS
Volume 157, Issue 2, Pages 689-714Publisher
Princeton Univ, Dept Mathematics
DOI: 10.4007/annals.2003.157.689
Keywords
-
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available