Bounds for codes by semidefinite programming

DOI10.1134/S0081543808040111zbMath1178.90269arXivmath/0609155OpenAlexW3187778384MaRDI QIDQ735630

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)

Related Items (4)

A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4 ⋮ Enumeration of irreducible contact graphs on the sphere ⋮ Towards a proof of the 24-cell conjecture ⋮ Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Codes in spherical caps
• The one-sided kissing number in four dimension
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• Nonexistence of certain symmetric spherical codes
• 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 of small size
• The kissing number in four dimensions
• The kissing problem in three dimensions
• Improved Delsarte bounds for spherical codes in small dimensions
• Hilbert distances and positive definite functions
• Two-point homogeneous spaces
• Positive definite functions on spheres
• Upper bounds for constant-weight codes
• Semidefinite optimization
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• New upper bounds for kissing numbers from semidefinite programming
• The problem of the twenty-five spheres
• Semidefinite Programming
• The Closest Packing of Spherical Caps in n Dimensions

This page was built for publication: Bounds for codes by semidefinite programming