Bounds for codes by semidefinite programming
From MaRDI portal
Abstract: Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that using as variables power sums of distances this problem can be considered as a finite semidefinite programming problem. This method allows to improve some linear programming upper bounds. In particular we obtain new bounds of one-sided kissing numbers.
Recommendations
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Improved Delsarte bounds for spherical codes in small dimensions
- New upper bounds for kissing numbers from semidefinite programming
- Strengthened semidefinite programming bounds for codes
- Spectral approach to linear programming bounds on codes
Cites work
- scientific article; zbMATH DE number 3543912 (Why is no real title available?)
- scientific article; zbMATH DE number 1224949 (Why is no real title available?)
- scientific article; zbMATH DE number 1284419 (Why is no real title available?)
- scientific article; zbMATH DE number 2115093 (Why is no real title available?)
- Codes in spherical caps
- Hilbert distances and positive definite functions
- Improved Delsarte bounds for spherical codes in small dimensions
- Linear programming bounds for codes of small size
- Multivariate positive definite functions on spheres
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- 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
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Nonexistence of certain symmetric spherical codes
- Positive definite functions on spheres
- Semidefinite Programming
- Semidefinite optimization
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Spherical codes and designs
- The Closest Packing of Spherical Caps in n Dimensions
- The kissing number in four dimensions
- The kissing problem in three dimensions
- The one-sided kissing number in four dimension
- The problem of the twenty-five spheres
- Two-point homogeneous spaces
- Upper bounds for constant-weight codes
Cited in
(23)- Strengthened semidefinite programming bounds for codes
- scientific article; zbMATH DE number 493090 (Why is no real title available?)
- Semidefinite programming bounds for the average kissing number
- Unique optima of the Delsarte linear program
- Semidefinite programming for permutation codes
- On an SDP relaxation for kissing number
- Spectral approach to linear programming bounds on codes
- Enumeration of irreducible contact graphs on the sphere
- Semidefinite programming bounds for Lee codes
- A Functional View of Upper Bounds on Codes
- Uniqueness of codes using semidefinite programming
- A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
- Exact Semidefinite Programming Bounds for Packing Problems
- Bounds for projective codes from semidefinite programming
- Semidefinite bounds for mixed binary/ternary codes
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Towards a proof of the 24-cell conjecture
- New upper bounds for kissing numbers from semidefinite programming
- scientific article; zbMATH DE number 2116354 (Why is no real title available?)
- Codes in spherical caps
- New and updated semidefinite programming bounds for subspace codes
This page was built for publication: Bounds for codes by semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735630)
