arXiv · 0708.3947
Optimality and uniqueness of the (4,10,1/6) spherical code
Abstract
Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t) spherical code. However, this method does not apply to the parameters (4,10,1/6). We use semidefinite programming bounds instead to show that the Petersen code, which consists of the midpoints of the edges of the regular simplex in dimension 4, is the unique (4,10,1/6) spherical code.
Explore related subjects
Keep this discovery
Christine Bachoc, Frank Vallentin. 2008-05-14. Optimality and uniqueness of the (4,10,1/6) spherical code. https://doi.org/10.1016/j.jcta.2008.05.001
Cite the original work for its findings. Save a collection to share your selection of sources.