On 3-distance spherical 5-designs

Abstract: Inspired by a recently formulated conjecture by Bannai et al. we investigate spherical codes which admit exactly three different distances and are spherical 5-designs. Computing and analyzing distance distributions we provide new proof of the fact (due to Levenshtein) that such codes are maximal and rule out certain cases towards a proof of the conjecture.

This page was built for publication: On 3-distance spherical 5-designs

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