arXiv:math/0610856 Abstract

arXiv:math/0610856 [math.MG]Abstract References Reviews Resources

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

Published 2006-10-27, updated 2007-10-18Version 2

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.

Comments: 15 pages, (v2) referee comments and suggestions incorporated

Journal: Europ. J. Comb. 30 (2009), 625-637.

DOI: 10.1016/j.ejc.2008.07.017

Categories: math.MG, math.CO

Subjects: 52C17, 90C22

Keywords: multivariate orthogonal polynomials, spherical caps, upper bounds, analytic bounds, semidefinite programming approach

Tags: journal article

Related articles: Most relevant | Search more

arXiv:math/0608426 [math.MG] (Published 2006-08-16, updated 2007-10-03)

New upper bounds for kissing numbers from semidefinite programming

Christine Bachoc, Frank Vallentin

arXiv:1206.2608 [math.MG] (Published 2012-06-12)

Upper bounds for packings of spheres of several radii

David de Laat, Fernando Mario de Oliveira Filho, Frank Vallentin

arXiv:2211.04406 [math.MG] (Published 2022-11-08)

Multiple Packing: Lower and Upper Bounds

Yihan Zhang, Shashank Vatedka

arXiv Analytics

arXiv:math/0610856 [math.MG]Abstract References Reviews Resources

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

Links

Toolbox

arXiv:math/0610856 [math.MG]AbstractReferencesReviewsResources

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

Links

Toolbox

arXiv:math/0610856 [math.MG]Abstract References Reviews Resources