Optimization Online


Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps

Christine Bachoc (christine.bachoc***at***math.u-bordeaux1.fr)
Frank Vallentin (f.vallentin***at***cwi.nl)

Abstract: In this paper we apply the semidefinite programming approach developed by the authors 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.

Keywords: spherical caps, one-sided kissing number, orthogonal polynomials

Category 1: Linear, Cone and Semidefinite Programming

Category 2: Combinatorial Optimization


Download: [Postscript][PDF]

Entry Submitted: 10/30/2006
Entry Accepted: 10/30/2006
Entry Last Modified: 10/30/2006

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society