Publication:

New Upper Bounds on Sphere Packings I

Loading...
Thumbnail Image

Date

2003

Journal Title

Journal ISSN

Volume Title

Publisher

Princeton University
The Harvard community has made this article openly available. Please share how this access benefits you.

Research Projects

Organizational Units

Journal Issue

Citation

Cohn, Henry and Noam D. Elkies. 2003. New upper bounds on sphere packings I. Annals of Mathematics 157, no. 2: 689-714.

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.

Description

Other Available Sources

Research Data

Keywords

Terms of Use

This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service

Endorsement

Review

Supplemented By

Related Stories