An extension the semidefinite programming bound for spherical codes
From MaRDI portal
Publication:6315564
arXiv1903.05767MaRDI QIDQ6315564FDOQ6315564
Authors: Oleg R. Musin 
Publication date: 13 March 2019
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.
This page was built for publication: An extension the semidefinite programming bound for spherical codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6315564)
