Improved Delsarte bounds for spherical codes in small dimensions
Florian Pfender · arXiv (Cornell University) · 2005
We present an extension of the Delsarte linear programming method. For several dimensions it yields improved upper bounds for kissing numbers and for spherical codes. Musin's recent work on kissing numbers in dimensions three and four can be viewed in our framework.