Moments of isotropic measures and optimal projective codes
arXiv:1904.11159
Abstract
In this paper, we use the linear programming approach to find new upper bounds for the moments of isotropic measures. These bounds are then utilized for finding lower packing bounds and energy bounds for projective codes. We also show that the obtained energy bounds are sharp for several infinite families of codes.
References in corpus (11)
- New upper bounds on sphere packings I
- The sphere packing problem in dimension 24
- The SIC Question: History and State of Play
- New upper bounds for kissing numbers from semidefinite programming
- Minimization of the Probabilistic p-frame Potential
- Experimental study of energy-minimizing point configurations on spheres
- Optimal simplices and codes in projective spaces
- Linear programming bounds for codes in Grassmannian spaces
- Upper bounds for packings of spheres of several radii
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Multivariate positive definite functions on spheres