New upper bounds for kissing numbers from semidefinite programming
Metric Geometry
2008-04-10 v4 Combinatorics
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
Cite
@article{arxiv.math/0608426,
title = {New upper bounds for kissing numbers from semidefinite programming},
author = {Christine Bachoc and Frank Vallentin},
journal= {arXiv preprint arXiv:math/0608426},
year = {2008}
}
Comments
17 pages, (v4) references updated, accepted in Journal of the American Mathematical Society