| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656590 | Journal of Combinatorial Theory, Series A | 2007 | 15 Pages |
Abstract
We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on kissing numbers. Musin's recent work on kissing numbers in dimensions three and four can be formulated in our framework.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
