Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
From MaRDI portal
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.
The authors apply the semidefinite programming approach developed in their previous paper [``New upper bounds for kissing numbers from semidefinite programming, J. Am. Math. Soc. 21, 909--924 (2008)] to obtain new upper bounds for codes in spherical caps. They compute new upper bounds for the one-sided kissing number in several dimensions where, in particular, they get a new tight bound in dimension 8. Furthermore, they show how to use the semidefinite programming framework to get analytic bounds.
Recommendations
- Bounds for codes by semidefinite programming
- On linear programming bounds for spherical codes and designs
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- scientific article; zbMATH DE number 4155150
- Semidefinite programming for permutation codes
- Codes and caps from orthogonal Grassmannians
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- Semidefinite programming in combinatorial and polynomial optimization
- Bounds for projective codes from semidefinite programming
- Strengthened semidefinite programming bounds for codes
Cites work
- Bounds for codes by semidefinite programming
- Codes in spherical caps
- CSDP, A C library for semidefinite programming
- scientific article; zbMATH DE number 3680654 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Linear programming bounds for codes in grassmannian spaces
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- New upper bounds for kissing numbers from semidefinite programming
- Optimal arrangements in packing congruent balls in a spherical container
- Spherical codes and designs
- Ten-neighbour packing of equal balls
- The one-sided kissing number in four dimension
- Uniqueness of Certain Spherical Codes
Cited in
(16)- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- A survey on spherical designs and algebraic combinatorics on spheres
- Bounds for projective codes from semidefinite programming
- Semidefinite programming bounds for the average kissing number
- On an SDP relaxation for kissing number
- A semidefinite programming hierarchy for packing problems in discrete geometry
- Invariant Semidefinite Programs
- New upper bounds for kissing numbers from semidefinite programming
- Exact Semidefinite Programming Bounds for Packing Problems
- Optimal arrangements of classical and quantum states with limited purity
- Three-point bounds for energy minimization
- On the method of packing geodesic circles into a spherical segment using a plane projection
- Towards a proof of the 24-cell conjecture
- Bounds for codes by semidefinite programming
- Codes in spherical caps
- A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
This page was built for publication: Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1011505)
