A bound on Grassmannian codes

DOI10.1016/j.jcta.2006.03.025zbMath1105.94024OpenAlexW1753813393MaRDI QIDQ855863

Alexander Barg, Dmitrii Yu. Nogin

Publication date: 7 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2006.03.025

zbMATH Keywords

spherical capisometric embeddingBlichfeldt's methodChordal distance

Mathematics Subject Classification ID

Grassmannians, Schubert varieties, flag manifolds (14M15) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

A survey on spherical designs and algebraic combinatorics on spheres

Cites Work

• A family of optimal packings in Grassmannian manifolds
• Formulas for Elementary Spherical Functions and Generalized Jacobi Polynomials
• Linear programming bounds for codes in grassmannian spaces
• The Geometry of Algorithms with Orthogonality Constraints
• Multiple-antenna signal constellations for fading channels
• Bounds on packings of spheres in the Grassmann manifold
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Normal Multivariate Analysis and the Orthogonal Group
• The Closest Packing of Spherical Caps in n Dimensions
• Unnamed Item
• Unnamed Item