Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
classification
🧮 math.MG
math.CO
keywords
boundscapscodesprogrammingsemidefinitesphericalupperanalytic
read the original abstract
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in particular get a new tight bound in dimension 8. Furthermore we show how to use the SDP framework to get analytic bounds.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.