Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
Publication:1011505
DOI10.1016/J.EJC.2008.07.017zbMath1171.94378arXivmath/0610856OpenAlexW2140695699MaRDI QIDQ1011505
Frank Vallentin, Christine Bachoc
Publication date: 8 April 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610856
bounds on codessemidefinite programmingkissing numbersmultivariable orthogonal polynomialscodes in spherical caps
Semidefinite programming (90C22) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Bounds on codes (94B65) Semi-infinite programming (90C34) Combinatorial codes (94B25)
Related Items (9)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds for codes by semidefinite programming
- Codes in spherical caps
- Optimal arrangements in packing congruent balls in a spherical container
- The one-sided kissing number in four dimension
- Ten-neighbour packing of equal balls
- Spherical codes and designs
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- Linear programming bounds for codes in grassmannian spaces
- New upper bounds for kissing numbers from semidefinite programming
- Uniqueness of Certain Spherical Codes
- CSDP, A C library for semidefinite programming
This page was built for publication: Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps