Bounds for spherical codes

MaRDI QIDQ6270807zbMATH OpenFDO

Authors Peter Keevash, Benny Sudakov

Publication date 24 February 2016

Abstract: A set $C$ of unit vectors in $mathbb{R}^d$ is called an $L$-spherical code if $xcdotyinL$ for any distinct $x,y$ in $C$. Spherical codes have been extensively studied since their introduction in the 1970's by Delsarte, Goethals and Seidel. In this note we prove a conjecture of Bukh on the maximum size of spherical codes. In particular, we show that for any set of $k$ fixed angles, one can choose at most $O(d^k)$ lines in $mathbb{R}^d$ such that any pair of them forms one of these angles.

This page was built for publication: Bounds for spherical codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6270807)