Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
| dc.creator | Bachoc, Christine | |
| dc.creator | Vallentin, Frank | |
| dc.date | 2006-10-27 | |
| dc.date | 2007-10-18 | |
| dc.date.accessioned | 2026-07-07T12:38:22Z | |
| dc.date.available | 2026-07-07T12:38:22Z | |
| dc.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. | |
| dc.description | 15 pages, (v2) referee comments and suggestions incorporated | |
| dc.identifier | https://arxiv.org/abs/math/0610856 | |
| dc.identifier | http://arxiv.org/abs/math/0610856 | |
| dc.identifier | Europ. J. Comb. 30 (2009), 625-637. | |
| dc.identifier | doi:10.1016/j.ejc.2008.07.017 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/218733 | |
| dc.subject | Metric Geometry | |
| dc.subject | Combinatorics | |
| dc.subject | 52C17, 90C22 | |
| dc.title | Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps | |
| dc.type | text |