Bounds for the sum of distances of spherical sets of small size

DOI10.1016/J.DISC.2023.113346MaRDI QIDQ6367128arXivFDO

Authors Alexander Barg, Peter Boyvalenkov, M. M. Stoyanova

Publication date 7 May 2021

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) General harmonic expansions, frames (42C15) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $Nsim{n}^{a}lpha,0<alphale2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical sets. We discuss asymptotic behavior of our bounds along with several examples of codes whose sum of distances closely follows the upper bound.

This page was built for publication: Bounds for the sum of distances of spherical sets of small size

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