Linear programming bounds for codes in grassmannian spaces
From MaRDI portal
Publication:3546522
DOI10.1109/TIT.2006.872973zbMath1282.94106arXivmath/0610812OpenAlexW2158306791MaRDI QIDQ3546522
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610812
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Related Items (17)
A bound on Grassmannian codes ⋮ Designs, groups and lattices ⋮ Three-point bounds for energy minimization ⋮ Spectral decomposition of discrepancy kernels on the Euclidean ball, the special orthogonal group, and the Grassmannian manifold ⋮ Linear programming bounds for regular graphs ⋮ Spectral approach to linear programming bounds on codes ⋮ Quasi Monte Carlo Integration and Kernel-Based Function Approximation on Grassmannians ⋮ Maximal orthoplectic fusion frames from mutually unbiased bases and block designs ⋮ Reproducing kernels for the irreducible components of polynomial spaces on unions of Grassmannians ⋮ Tight \(p\)-fusion frames ⋮ Bounds for codes and designs in complex subspaces ⋮ Invariant Semidefinite Programs ⋮ Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps ⋮ Curve based approximation of measures on manifolds by discrepancy minimization ⋮ Unitary designs and codes ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Lower bounds for measurable chromatic numbers
This page was built for publication: Linear programming bounds for codes in grassmannian spaces
