New upper bounds for kissing numbers from semidefinite programming
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
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.
17 pages, (v4) references updated, accepted in Journal of the American Mathematical Society
17 pages, (v4) references updated, accepted in Journal of the American Mathematical Society