Pages that link to "Item:Q3546522"
From MaRDI portal
The following pages link to Linear programming bounds for codes in grassmannian spaces (Q3546522):
Displaying 17 items.
- Spectral approach to linear programming bounds on codes (Q415647) (← links)
- A bound on Grassmannian codes (Q855863) (← links)
- Linear programming bounds for regular graphs (Q897255) (← links)
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps (Q1011505) (← links)
- Unitary designs and codes (Q1035804) (← links)
- A survey on spherical designs and algebraic combinatorics on spheres (Q1039420) (← links)
- Lower bounds for measurable chromatic numbers (Q1047119) (← links)
- Reproducing kernels for the irreducible components of polynomial spaces on unions of Grassmannians (Q1755508) (← links)
- Curve based approximation of measures on manifolds by discrepancy minimization (Q2067682) (← links)
- Tight \(p\)-fusion frames (Q2252125) (← links)
- Bounds for codes and designs in complex subspaces (Q2269527) (← links)
- Designs, groups and lattices (Q2388605) (← links)
- Invariant Semidefinite Programs (Q2802527) (← links)
- Quasi Monte Carlo Integration and Kernel-Based Function Approximation on Grassmannians (Q4609734) (← links)
- Maximal orthoplectic fusion frames from mutually unbiased bases and block designs (Q4609843) (← links)
- Three-point bounds for energy minimization (Q5326480) (← links)
- Spectral decomposition of discrepancy kernels on the Euclidean ball, the special orthogonal group, and the Grassmannian manifold (Q6101227) (← links)
