Pages that link to "Item:Q1805056"
From MaRDI portal
The following pages link to On upper bounds for code distance and covering radius of designs in polynomial metric spaces (Q1805056):
Displaying 15 items.
- An extremum problem for polynomials and bounds for codes with given distance and diameter (Q596963) (← links)
- The covering radius of spherical designs (Q1178026) (← links)
- Designs as maximum codes in polynomial metric spaces (Q1201908) (← links)
- An extremal problem for algebraic polynomials with zero mean value on an interval (Q1277526) (← links)
- On the covering radius of an unrestricted code as a function of the rate and dual distance (Q1383375) (← links)
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces (Q1805056) (← links)
- Improvement of the Delsarte bound for \(\tau\)-designs when it is not the best bound possible (Q1869830) (← links)
- Linear programming bounds for covering radius of spherical designs (Q2038844) (← links)
- Nikolskii constants for polynomials on the unit sphere (Q2177963) (← links)
- On polarization of spherical codes and designs (Q2695978) (← links)
- (Q4500985) (← links)
- Least distortion Euclidean embeddings of flat tori (Q6060342) (← links)
- Absolute minima of potentials of certain regular spherical configurations (Q6093300) (← links)
- Odd strength spherical designs attaining the Fazekas-Levenshtein bound for covering and universal minima of potentials (Q6130589) (← links)
- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000 (Q6655413) (← links)
