The Tietäväinen bound for spherical codes
type: Item
instance of: scholarly article
title: The Tietäväinen bound for spherical codes
zbMATH Open document ID: 0553.94014
DOI: 10.1016/0166-218X(84)90110-0
published in: Discrete Applied Mathematics
publication date: 1984-01-01T00:00:00Z
review text: \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.
reviewed by: Bai Kishan Dass
Mathematics Subject Classification ID: 94B60
zbMATH DE Number: 3882343
zbMATH Keywords: distance distribution
zbMATH Keywords: upper bound
zbMATH Keywords: binary codes
zbMATH Keywords: spherical codes
author: Jaakko Astola
MaRDI profile type: Publication
cites work: Q5606006
cites work: Spherical codes and designs
cites work: Hamming Association Schemes and Codes on Spheres
cites work: Sphere-packing in the Hamming metric
cites work: New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
cites work: Bounds for binary codes just outside the plotkin range
description: scientific article; zbMATH DE number 3882343