Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
Metric Geometry
2009-02-06 v2 Combinatorics
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.
Cite
@article{arxiv.math/0610856,
title = {Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps},
author = {Christine Bachoc and Frank Vallentin},
journal= {arXiv preprint arXiv:math/0610856},
year = {2009}
}
Comments
15 pages, (v2) referee comments and suggestions incorporated