New Upper Bounds on Sphere Packings I
MetadataShow full item record
CitationCohn, Henry and Noam D. Elkies. 2003. New upper bounds on sphere packings I. Annals of Mathematics 157, no. 2: 689-714.
AbstractWe 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.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:2960190
- FAS Scholarly Articles