On upper bounds for code distance and covering radius of designs in polynomial metric spaces
From MaRDI portal
Publication:1805056
Recommendations
Cites work
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3818560 (Why is no real title available?)
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- scientific article; zbMATH DE number 3680654 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3503264 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3633251 (Why is no real title available?)
- scientific article; zbMATH DE number 3083637 (Why is no real title available?)
- A characterization of \(P\)- and \(Q\)-polynomial association schemes
- An upper bound on the covering radius as a function of the dual distance
- Association schemes and t-designs in regular semilattices
- Averaging sets: A generalization of mean values and spherical designs
- Covering radius and dual distance
- Designs as maximum codes in polynomial metric spaces
- Discrete quadrature and bounds on t-designs
- Extremal polynomials used in bounds of code volume
- Generalization of the Norse bounds to codes of higher strength
- Hahn Polynomials, Discrete Harmonics, andt-Designs
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- On the covering radius of binary codes (Corresp.)
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- Orthogonal Polynomials, Duality and Association Schemes
- Packing and decomposition problems for polynomial association schemes
- Polynomial spaces
- Recent bounds for codes, sphere packings and related problems obtained by linear programming and other methods
- Spherical codes and designs
- The covering radius of spherical designs
- Tight Spherical Disigns, II
- Tight spherical designs. I
- Two-point homogeneous spaces
- Upper bounds on the cardinality of a binary code with a given minimum distance
- t-designs in projective spaces
Cited in
(14)- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
- On the covering radius of an unrestricted code as a function of the rate and dual distance
- Nikolskii constants for polynomials on the unit sphere
- scientific article; zbMATH DE number 1498794 (Why is no real title available?)
- Linear programming bounds for covering radius of spherical designs
- On polarization of spherical codes and designs
- Odd strength spherical designs attaining the Fazekas-Levenshtein bound for covering and universal minima of potentials
- Least distortion Euclidean embeddings of flat tori
- Designs as maximum codes in polynomial metric spaces
- Improvement of the Delsarte bound for \(\tau\)-designs when it is not the best bound possible
- 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
- An extremum problem for polynomials and bounds for codes with given distance and diameter
- Absolute minima of potentials of certain regular spherical configurations
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)
