New upper bounds for kissing numbers from semidefinite programming
classification
🧮 math.MG
math.CO
keywords
boundsuppercodeskissingprogrammingsemidefiniteadaptapproach
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.