Upper bounds for energies of spherical codes of given cardinality and separation
From MaRDI portal
Publication:2200514
Abstract: We introduce a linear programming framework for obtaining upper bounds for the potential energy of spherical codes of fixed cardinality and minimum distance. Using Hermite interpolation we construct polynomials to derive corresponding bounds. These bounds are universal in the sense that they are valid for all absolutely monotone potential functions and the required interpolation nodes do not depend on the potentials.
Recommendations
- Upper bounds on the minimum distance of spherical codes
- Publication:4865450
- Asymptotic bounds for spherical codes
- Universal lower bounds for potential energy of spherical codes
- Bounds for spherical codes: the Levenshtein framework lifted
- scientific article; zbMATH DE number 1189034
- The Tietäväinen bound for spherical codes
- scientific article; zbMATH DE number 1189033
- Upper bounds for the cardinality of s-distances codes
- Improved sphere bounds on the covering radius of codes
Cites work
- scientific article; zbMATH DE number 3680654 (Why is no real title available?)
- scientific article; zbMATH DE number 1284419 (Why is no real title available?)
- A survey on the kissing numbers.
- Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
- Codes on Euclidean spheres
- Comparison of probabilistic and deterministic point sets on the sphere
- Das Problem der dreizehn Kugeln
- Designs as maximum codes in polynomial metric spaces
- Discrepancy, separation and Riesz energy of finite point sets on the unit sphere
- Discrete energy on rectifiable sets
- Energy bounds for codes and designs in Hamming spaces
- Energy bounds for codes in polynomial metric spaces
- Estimates for Logarithmic and Riesz Energies of Spherical t-Designs
- Experimental study of energy-minimizing point configurations on spheres
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- Minimum of the energy potential of a point system of charges
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- New upper bounds for kissing numbers from semidefinite programming
- On means of distances on the surface of a sphere. II: Upper bounds
- On spherical codes with inner products in a prescribed interval
- Positive definite functions on spheres
- Renormalized energy and asymptotic expansion of optimal logarithmic energy on the sphere
- Spherical codes and designs
- Spherical designs of harmonic index \(t\)
- The Addition Formula for Jacobi Polynomials and Spherical Harmonics
- The Coulomb energy of spherical designs on \(S^{2}\)
- The \(s\)-energy of spherical designs on \(S^{2}\)
- The kissing number in four dimensions
- Universal lower bounds for potential energy of spherical codes
- Universal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codes
- Universal upper and lower bounds on energy of spherical designs
- Universally optimal distribution of points on spheres
- Well-separated spherical designs
Cited in
(9)- Upper bounds on the minimum distance of spherical codes
- On spherical codes with inner products in a prescribed interval
- Universal lower bounds for potential energy of spherical codes
- STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES
- Bounds for the sum of distances of spherical sets of small size
- Universal upper and lower bounds on energy of spherical designs
- Upper energy bounds for spherical designs of relatively small cardinalities
- Energy bounds for codes and designs in Hamming spaces
- Bounds for spherical codes: the Levenshtein framework lifted
This page was built for publication: Upper bounds for energies of spherical codes of given cardinality and separation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200514)
