Improved Delsarte bounds for spherical codes in small dimensions

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.