On upper bounds for code distance and covering radius of designs in polynomial metric spaces

DOI10.1016/0097-3165(95)90093-4zbMath0842.05097OpenAlexW2057010175MaRDI QIDQ1805056

G. Fazekas, Vladimir I. Levenshtein

Publication date: 11 June 1995

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(95)90093-4

zbMATH Keywords

orthogonal polynomialscovering radiusdesignscode distancepolynomial metric spacesantipodal spacesNorse bound

Mathematics Subject Classification ID

Related Items (9)

Nikolskii constants for polynomials on the unit sphere ⋮ On the covering radius of an unrestricted code as a function of the rate and dual distance ⋮ Least distortion Euclidean embeddings of flat tori ⋮ Absolute minima of potentials of certain regular spherical configurations ⋮ Odd strength spherical designs attaining the Fazekas-Levenshtein bound for covering and universal minima of potentials ⋮ On polarization of spherical codes and designs ⋮ Linear programming bounds for covering radius of spherical designs ⋮ On upper bounds for code distance and covering radius of designs in polynomial metric spaces ⋮ An extremal problem for algebraic polynomials with zero mean value on an interval

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• t-designs in projective spaces
• Covering radius and dual distance
• Averaging sets: A generalization of mean values and spherical designs
• A characterization of \(P\)- and \(Q\)-polynomial association schemes
• Extremal polynomials used in bounds of code volume
• The covering radius of spherical designs
• Designs as maximum codes in polynomial metric spaces
• Association schemes and t-designs in regular semilattices
• Spherical codes and designs
• Tight spherical designs. I
• Discrete quadrature and bounds on t-designs
• Packing and decomposition problems for polynomial association schemes
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces
• Polynomial spaces
• Two-point homogeneous spaces
• Generalization of the Norse bounds to codes of higher strength
• An upper bound on the covering radius as a function of the dual distance
• Tight Spherical Disigns, II
• Recent bounds for codes, sphere packings and related problems obtained by linear programming and other methods
• Orthogonal Polynomials, Duality and Association Schemes
• Upper bounds on the cardinality of a binary code with a given minimum distance
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• On the covering radius of binary codes (Corresp.)
• Hahn Polynomials, Discrete Harmonics, andt-Designs

This page was built for publication: On upper bounds for code distance and covering radius of designs in polynomial metric spaces