Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
15 pages, (v2) referee comments and suggestions incorporated

Keywords

Metric Geometry, Combinatorics, 52C17, 90C22

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/218733

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0610856
 http://arxiv.org/abs/math/0610856
 Europ. J. Comb. 30 (2009), 625-637.
 doi:10.1016/j.ejc.2008.07.017

Collections

arXiv