An extension the semidefinite programming bound for spherical codes

Abstract

In this paper we present an extension of known semidefinite and linear programming upper bounds for spherical codes and consider a version of this bound for distance graphs. We apply the main result for the distance distribution of a spherical code.

11 pages

References in corpus (6)

• New upper bounds for kissing numbers from semidefinite programming
• High accuracy semidefinite programming bounds for kissing numbers
• The strong thirteen spheres problem
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• Optimality and uniqueness of the (4,10,1/6) spherical code
• $k$-point semidefinite programming bounds for equiangular lines