Bounds for spherical codes: The Levenshtein framework lifted

DOI10.1090/mcom/3621zbMath1475.94214OpenAlexW3118326075MaRDI QIDQ5856745

M. M. Stoyanova, Peter D. Dragnev, P. G. Boyvalenkov, Edward B. Saff, Douglas P. Hardin

Publication date: 29 March 2021

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/mcom/3621

zbMATH Keywords

linear programmingminimal energy problemsbounds for codesLevenshtein framework

Mathematics Subject Classification ID

Linear programming (90C05) Bounds on codes (94B65)

Related Items

On polarization of spherical codes and designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal lower bounds for potential energy of spherical codes
• Hermite-Birkhoff interpolation problems in Haar subspaces
• Designs as maximum codes in polynomial metric spaces
• Spherical codes and designs
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• A minimal design of order 11 on the 3-sphere
• Extremal polynomials for obtaining bounds for spherical codes and designs
• The kissing number in four dimensions
• Experimental Study of Energy-Minimizing Point Configurations on Spheres
• Universally optimal distribution of points on spheres
• Packing of spheres in spaces of constant curvature
• The minimum of potential energy of a System of point charges
• Differentiable Tchebycheff subspaces and Hermite interpolation
• Association schemes and coding theory
• A spherical code
• Upper bounds on the minimum distance of spherical codes
• Discrete Energy on Rectifiable Sets
• Three-point bounds for energy minimization
• TheD₄Root System Is Not Universally Optimal
• Linearization of the Product of Jacobi Polynomials. II
• Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\)