The Tietäväinen bound for spherical codes (Q759729)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Tietäväinen bound for spherical codes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Tietäväinen bound for spherical codes |
scientific article |
Statements
The Tietäväinen bound for spherical codes (English)
0 references
1984
0 references
\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.
0 references
distance distribution
0 references
upper bound
0 references
binary codes
0 references
spherical codes
0 references
