New upper bounds for spherical codes and packings
From MaRDI portal
Abstract: We improve the previously best known upper bounds on the sizes of -spherical codes for every at least by a factor of , in sufficiently high dimensions. Furthermore, for sphere packing densities in dimensions we have an improvement at least by a factor of . Our method also breaks many non-numerical sphere packing density bounds in smaller dimensions. This is the first such improvement for each dimension since the work of Kabatyanskii and Levenshtein cite{KL} and its later improvement by Levenshtein cite{Leven79}. Novelties of this paper include the analysis of triple correlations, usage of the concentration of mass in high dimensions, and the study of the spacings between the roots of Jacobi polynomials.
This page was built for publication: New upper bounds for spherical codes and packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6332133)