Skip to main content


Weitere Artikel dieser Ausgabe durch Wischen aufrufen


Upper bounds for energies of spherical codes of given cardinality and separation

Designs, Codes and Cryptography
P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff, M. M. Stoyanova
Wichtige Hinweise
The research of P. G. Boyvalenkov was partially supported by the National Scientific Program “Information and Communication Technologies for a Single Digital Market in Science, Education and Security (ICTinSES)”, financed by the Bulgarian Ministry of Education and Science. The research of P. D. Dragnev was supported, in part, by a Simons Foundation Grant No. 282207. The research of D. P. Hardin and E. B. Saff was supported, in part, by the U. S. National Science Foundation under Grant DMS-1516400. The research of M. M. Stoyanova was supported by a Bulgarian NSF contract DN2/02-2016. Research for this article was started while the authors were in residence at the Institute for Computational and Experimental Research in Mathematics in Providence, RI, during the “Point Configurations in Geometry, Physics and Computer Science” program supported by the National Science Foundation under Grant No. DMS-1439786.
This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding and Cryptography 2019”.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.


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.

Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten

Über diesen Artikel

Premium Partner