New upper bounds on sphere packings I
New upper bounds on sphere packings I
复制标题
DOI：
10.4007/annals.2003.157.689
复制
发表时间：
2003-03-01
影响因子：
4.9
通讯作者：
Elkies, N
中科院分区：
文献类型：
--
作者：
Cohn, H;Elkies, N
我们建立了纠错码线性规划界的球填充模拟，并用它证明了球填充密度的上界是最好的。至少已知4到36维的边界。我们推测我们的方法可以用于解决8维和24维的球体填充问题。
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.