An extension the semidefinite programming bound for spherical codes
Optimization and Control
2019-03-15 v1 Metric Geometry
Abstract
In this paper we present an extension of known semidefinite and linear programming upper bounds for spherical codes and consider a version of this bound for distance graphs. We apply the main result for the distance distribution of a spherical code.
Keywords
Cite
@article{arxiv.1903.05767,
title = {An extension the semidefinite programming bound for spherical codes},
author = {Oleg R. Musin},
journal= {arXiv preprint arXiv:1903.05767},
year = {2019}
}
Comments
11 pages