The Tietäväinen bound for spherical codes
\textit{A. Tietäväinen} [Inf. Control 47, 85-93 (1980; Zbl 0471.94013)] derived an upper bound on the number of codewords in a binary code of word length n and minimum distance d in the case \(n=2d+j\), j small. This paper shows that an analog of the Tietäväinen bound for binary codes holds also for spherical codes.
scientific article; zbMATH DE number 3882343