Pages that link to "Item:Q1895969"
From MaRDI portal
The following pages link to Extremal polynomials for obtaining bounds for spherical codes and designs (Q1895969):
Displaying 16 items.
- An extremum problem for polynomials and bounds for codes with given distance and diameter (Q596963) (← links)
- On linear programming bounds for spherical codes and designs (Q701789) (← links)
- An elementary derivation of the annihilator polynomial for extremal \((2s+1)\)-designs (Q912851) (← links)
- Lower bounds for projective designs, cubature formulas and related isometric embeddings (Q1024276) (← links)
- A survey on spherical designs and algebraic combinatorics on spheres (Q1039420) (← links)
- On lower bounds on the size of designs in compact symmetric spaces of rank 1 (Q1359065) (← links)
- An extremum problem for polynomials related to codes and designs (Q1585648) (← links)
- Linear programming bounds for codes in infinite projective spaces (Q1818899) (← links)
- Linear programming bounds for covering radius of spherical designs (Q2038844) (← links)
- Upper energy bounds for spherical designs of relatively small cardinalities (Q2223636) (← links)
- On polarization of spherical codes and designs (Q2695978) (← links)
- Codes and designs (Q4367626) (← links)
- Bounds for spherical codes: The Levenshtein framework lifted (Q5856745) (← links)
- Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\) (Q5942008) (← links)
- Uniqueness of the 120-point spherical 11-design in four dimensions (Q5956003) (← links)
- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000 (Q6655413) (← links)
