|
|||||
|
|
New upper bounds for kissing numbers from semidefinite programming |
|
| Authors: | Christine Bachoc Frank Vallentin |
| Affiliation: | Laboratoire A2X, Université Bordeaux I, 351, cours de la Libération, 33405 Talence, France ; Centrum voor Wiskunde en Informatica (CWI), Kruislaan 413, 1098 SJ Amsterdam, The Netherlands |
| 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  . |
| Keywords: | Spherical codes kissing number semidefinite programming orthogonal polynomials |
| 点击此处可从《Journal of the American Mathematical Society》浏览原始摘要信息 | |
| 点击此处可从《Journal of the American Mathematical Society》下载全文 | |