Improved Delsarte bounds for spherical codes in small dimensions

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.

• Type: Journal
• Year: 2007
• Where: JCT
• Authors: Florian Pfender
• Keywords: Delsarte Linear, Dimensions, JCT 2007, Spherical Codes