Bounds for codes by semidefinite programming

DOI10.1134/S0081543808040111MaRDI QIDQ735630zbMATH OpenOpenAlexFDO

Authors Oleg R. Musin

Publication date 23 October 2009

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0609155

Mathematics Subject Classification ID

Semidefinite programming (90C22)

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

• Codes in spherical caps
• Hilbert distances and positive definite functions
• scientific article; zbMATH DE number 3543912 (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?)
• Improved Delsarte bounds for spherical codes in small dimensions
• Linear programming bounds for codes of small size
• Multivariate positive definite functions on spheres
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• 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 optimization
• Semidefinite Programming
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
• 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)

• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• Semidefinite bounds for mixed binary/ternary codes
• Bounds for projective codes from semidefinite programming
• Uniqueness of codes using semidefinite programming
• Semidefinite programming bounds for the average kissing number
• On an SDP relaxation for kissing number
• New and updated semidefinite programming bounds for subspace codes
• Enumeration of irreducible contact graphs on the sphere
• Semidefinite programming bounds for Lee codes
• Semidefinite programming for permutation codes
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• New upper bounds for kissing numbers from semidefinite programming
• A Functional View of Upper Bounds on Codes
• Spectral approach to linear programming bounds on codes
• scientific article; zbMATH DE number 493090 (Why is no real title available?)
• scientific article; zbMATH DE number 2116354 (Why is no real title available?)
• Exact Semidefinite Programming Bounds for Packing Problems
• Unique optima of the Delsarte linear program
• Towards a proof of the 24-cell conjecture
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Strengthened semidefinite programming bounds for codes
• 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: 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)