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

DOI10.1016/0097-3165(95)90093-4zbMATH Open0842.05097OpenAlexW2057010175MaRDI QIDQ1805056FDOQ1805056

Authors: Gábor Fazekas, Vladimir 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

Recommendations

• scientific article; zbMATH DE number 503183
• Designs as maximum codes in polynomial metric spaces
• Necessary conditions for existence of some designs in polynomial metric spaces
• scientific article; zbMATH DE number 1498794

zbMATH Keywords

orthogonal polynomialscovering radiusdesignscode distancepolynomial metric spacesantipodal spacesNorse bound

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30)

Cites Work

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

Cited In (14)

• On the covering radius of an unrestricted code as a function of the rate and dual distance
• Title not available (Why is that?)
• An extremal problem for algebraic polynomials with zero mean value on an interval
• Least distortion Euclidean embeddings of flat tori
• An extremum problem for polynomials and bounds for codes with given distance and diameter
• Linear programming bounds for covering radius of spherical designs
• Improvement of the Delsarte bound for \(\tau\)-designs when it is not the best bound possible
• On polarization of spherical codes and designs
• Absolute minima of potentials of certain regular spherical configurations
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces
• The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
• Nikolskii constants for polynomials on the unit sphere
• Designs as maximum codes in polynomial metric spaces
• Odd strength spherical designs attaining the Fazekas-Levenshtein bound for covering and universal minima of potentials

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805056)