New upper bounds on sphere packings I

Type: Article

Publication Date: 2003-03-01

Citations: 306

DOI: https://doi.org/10.4007/annals.2003.157.689

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.

Locations

  • arXiv (Cornell University) - View - PDF
  • Digital Access to Scholarship at Harvard (DASH) (Harvard University) - View - PDF
  • DataCite API - View
  • Annals of Mathematics - View - PDF

Similar Works

Action Title Year Authors
+ Bounds for Codes and Sphere Packings 1993 N. J. A. Sloane
+ Bounds for Codes and Sphere Packings 1988 N. J. A. Sloane
+ Bounds for Codes and Sphere Packings 1999 N. J. A. Sloane
+ A new lower bound for sphere packing 2023 Marcelo Campos
Matthew Jenssen
Marcus Michelen
Julian Sahasrabudhe
+ New Provisional Lower Bounds on the Optimal Density of Sphere Packings 2005 Salvatore Torquato
Frank H. Stillinger
+ PDF Chat New upper bounds on sphere packings II 2002 Henry Cohn
+ A Note on Sphere Packings in High Dimension 2012 Akshay Venkatesh
+ PDF Chat New upper bounds for spherical codes and packings 2023 Naser T. Sardari
Masoud Zargar
+ PDF Chat Sphere packing bounds via spherical codes 2014 Henry Cohn
Yufei Zhao
+ A new upper bound for spherical codes. 2020 Naser T. Sardari
Masoud Zargar
+ Sphere Packings, IV. Detailed Bounds 2011 Thomas C. Hales
+ Sphere Packing and Error-Correcting Codes 1999 John Leech
N. J. A. Sloane
+ Three-point bounds for sphere packing 2022 Henry Cohn
David de Laat
Andrew Salmon
+ New upper bounds for spherical codes and packings 2020 Naser T. Sardari
Masoud Zargar
+ PDF Chat Improved sphere packing lower bounds from Hurwitz lattices 2011 Stephanie Vance
+ Improved efficiency for explicit covering codes matching the sphere-covering bound. 2019 Aditya Potukuchi
Yihan Zhang
+ PDF Chat New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere 2011 Vladimir Blinovsky
Simon Litsyn
+ The Sphere-Packing Problem 2002 N. J. A. Sloane
+ Dual linear programming bounds for sphere packing via modular forms 2019 Henry Cohn
Nicholas Triantafillou
+ Dual linear programming bounds for sphere packing via modular forms 2019 Henry Cohn
Nicholas Triantafillou