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.
, , , ,
Cornell University Library
arXiv.org e-Print archive
Semidefinite programming and combinatorial optimization , Spinoza prijs Lex Schrijver
Networks and Optimization

Bachoc, C, & Vallentin, F. (2006). Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps. arXiv.org e-Print archive. Cornell University Library .