  We present an extension of known semidefinite and linear programming upper
bounds for spherical codes. We apply the main result for the distance
distribution of a spherical code and show that this method can work effectively
In particular, we get a shorter solution to the kissing number problem in
dimension 4.
