New upper bounds for kissing numbers from semidefinite programming
Idioma
en
Article de revue
Este ítem está publicado en
Journal of the American Mathematical Society. 2008, vol. 21, p. 909--924
American Mathematical Society
Resumen en inglés
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 ...Leer más >
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.< Leer menos
Orígen
Importado de HalCentros de investigación