Optimization Online


New upper bounds for kissing numbers from semidefinite programming

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

Abstract: Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions. In particular our computations give the (known) values for the cases n = 3, 4, 8, 24.

Keywords: spherical codes, kissing number, semidefinite programming, Delsarte's method

Category 1: Linear, Cone and Semidefinite Programming

Category 2: Combinatorial Optimization


Download: [Postscript][PDF]

Entry Submitted: 08/16/2006
Entry Accepted: 08/16/2006
Entry Last Modified: 10/17/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