2006-08-01
New upper bounds for kissing numbers from semidefinite programming
Publication
Publication
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.
| Additional Metadata | |
|---|---|
| , , , | |
| , | |
| Cornell University Library | |
| arXiv.org e-Print archive | |
| Semidefinite programming and combinatorial optimization , Spinoza prijs Lex Schrijver | |
| Organisation | Networks and Optimization |
|
Bachoc, C., & Vallentin, F. (2006). New upper bounds for kissing numbers from semidefinite programming. arXiv.org e-Print archive. Cornell University Library. |
|
