Improved Delsarte bounds for spherical codes in small dimensions
classification
🧮 math.CO
keywords
dimensionsboundscodesdelsarteimprovedkissingnumbersspherical
read the original abstract
We present an extension of the Delsarte linear programming method. For several dimensions it yields improved upper bounds for kissing numbers and for spherical codes. Musin's recent work on kissing numbers in dimensions three and four can be viewed in our framework.
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.