An extension the semidefinite programming bound for spherical codes
Oleg R. Musin
TL;DR
This paper extends existing semidefinite and linear programming bounds for spherical codes and applies these bounds to distance graphs, improving the understanding of code distributions on spheres.
Contribution
It introduces an extended bound for spherical codes and adapts it for distance graphs, advancing the theoretical framework for code optimization.
Findings
Extended semidefinite programming bounds for spherical codes.
Application of bounds to distance distributions.
Enhanced theoretical tools for spherical code analysis.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · graph theory and CDMA systems · Advanced Graph Theory Research