Bounds for spherical codes: the Levenshtein framework lifted
From MaRDI portal
Recommendations
Cites work
- A minimal design of order 11 on the 3-sphere
- A spherical code
- Association schemes and coding theory
- Designs as maximum codes in polynomial metric spaces
- Differentiable Tchebycheff subspaces and Hermite interpolation
- Discrete energy on rectifiable sets
- Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\)
- Experimental study of energy-minimizing point configurations on spheres
- Extremal polynomials for obtaining bounds for spherical codes and designs
- Hermite-Birkhoff interpolation problems in Haar subspaces
- scientific article; zbMATH DE number 2134205 (Why is no real title available?)
- scientific article; zbMATH DE number 3818560 (Why is no real title available?)
- scientific article; zbMATH DE number 3179593 (Why is no real title available?)
- scientific article; zbMATH DE number 49108 (Why is no real title available?)
- scientific article; zbMATH DE number 3633251 (Why is no real title available?)
- scientific article; zbMATH DE number 1284419 (Why is no real title available?)
- scientific article; zbMATH DE number 1474107 (Why is no real title available?)
- scientific article; zbMATH DE number 2117213 (Why is no real title available?)
- scientific article; zbMATH DE number 3289061 (Why is no real title available?)
- Indexes of spherical codes
- Linearization of the Product of Jacobi Polynomials. II
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- Packing of spheres in spaces of constant curvature
- Polynomials of least deviation from zero and Chebyshev-type cubature formulas
- Spherical codes and designs
- The kissing number in four dimensions
- The minimum of potential energy of a System of point charges
- TheD4Root System Is Not Universally Optimal
- Three-point bounds for energy minimization
- Universal lower bounds for potential energy of spherical codes
- Universally optimal distribution of points on spheres
- Upper bounds on the minimum distance of spherical codes
Cited in
(14)- Improved linear programming bounds for antipodal spherical codes.
- On spherical codes with inner products in a prescribed interval
- Upper bounds for energies of spherical codes of given cardinality and separation
- Improved Delsarte bounds for spherical codes in small dimensions
- On polarization of spherical codes and designs
- Nearest neighbor algorithm for spherical codes from the Leech lattice
- Sphere-bound-achieving coset codes and multilevel coset codes
- Upper bounds on the minimum distance of spherical codes
- Universal bounds for spherical codes: the Levenshtein framework lifted
- Bounds on energy and potentials of discrete measures on the sphere
- Universal minima of discrete potentials for sharp spherical codes
- On linear programming bounds for spherical codes and designs
- Energy bounds for weighted spherical codes and designs via linear programming
- Universal lower bounds for potential energy of spherical codes
This page was built for publication: Bounds for spherical codes: the Levenshtein framework lifted
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5856745)
