On upper bounds for code distance and covering radius of designs in polynomial metric spaces
type: Item
instance of: scholarly article
title: On upper bounds for code distance and covering radius of designs in polynomial metric spaces
zbMATH Open document ID: 0842.05097
DOI: 10.1016/0097-3165(95)90093-4
author: Gábor Fazekas
author: Vladimir Levenshtein
published in: Journal of Combinatorial Theory. Series A
publication date: 1995-06-11T00:00:00Z
review text: Bounds are given for the code distance and the covering radius of designs in polynomial metric spaces. These bounds generalize the Norse bound for the covering radius of antipodal 2-designs in antipodal spaces. It is also shown that the bound is attained in the case of tight \(2k\)-designs in antipodal spaces. The results were obtained by solving an extremal problem for systems of orthogonal polynomials.
Mathematics Subject Classification ID: 05E30
Mathematics Subject Classification ID: 05B30
Mathematics Subject Classification ID: 05E35
zbMATH DE Number: 753618
zbMATH Keywords: code distance
zbMATH Keywords: covering radius
zbMATH Keywords: designs
zbMATH Keywords: polynomial metric spaces
zbMATH Keywords: Norse bound
zbMATH Keywords: antipodal spaces
zbMATH Keywords: orthogonal polynomials
reviewed by: Neal Brand
MaRDI profile type: Publication
full work available at URL: 0097-3165(95)90093-4
OpenAlex ID: W2057010175
cites work: Q3218140
cites work: Tight spherical designs. I
cites work: Tight Spherical Disigns, II
cites work: Q3686719
cites work: Q5824493
cites work: Q3992965
cites work: Q4083446
cites work: Association schemes and t-designs in regular semilattices
cites work: Spherical codes and designs
cites work: Hahn Polynomials, Discrete Harmonics, andt-Designs
cites work: Discrete quadrature and bounds on t-designs
cites work: Polynomial spaces
cites work: On the covering radius of binary codes (Corresp.)
cites work: t-designs in projective spaces
cites work: Q4194048
cites work: Orthogonal Polynomials, Duality and Association Schemes
cites work: Q3876610
cites work: Q3665801
cites work: Packing and decomposition problems for polynomial association schemes
cites work: Designs as maximum codes in polynomial metric spaces
cites work: Q4146667
cites work: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
cites work: Averaging sets: A generalization of mean values and spherical designs
cites work: Upper bounds on the cardinality of a binary code with a given minimum distance
cites work: Extremal polynomials used in bounds of code volume
cites work: Recent bounds for codes, sphere packings and related problems obtained by linear programming and other methods
cites work: Generalization of the Norse bounds to codes of higher strength
cites work: The covering radius of spherical designs
cites work: A characterization of \(P\)- and \(Q\)-polynomial association schemes
cites work: An upper bound on the covering radius as a function of the dual distance
cites work: Covering radius and dual distance
cites work: Two-point homogeneous spaces
description: scientific article; zbMATH DE number 753618