A bound on Grassmannian codes
DOI10.1016/J.JCTA.2006.03.025zbMATH Open1105.94024OpenAlexW1753813393MaRDI QIDQ855863FDOQ855863
Authors: 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
Recommendations
Grassmannians, Schubert varieties, flag manifolds (14M15) Bounds on codes (94B65) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cites Work
- The Geometry of Algorithms with Orthogonality Constraints
- Title not available (Why is that?)
- Normal Multivariate Analysis and the Orthogonal Group
- Title not available (Why is that?)
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- The Closest Packing of Spherical Caps in n Dimensions
- Linear programming bounds for codes in grassmannian spaces
- A family of optimal packings in Grassmannian manifolds
- Bounds on packings of spheres in the Grassmann manifold
- Formulas for Elementary Spherical Functions and Generalized Jacobi Polynomials
- Multiple-antenna signal constellations for fading channels
Cited In (10)
- Grassmannian codes from paired difference sets
- Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds
- Grassmannian frames with applications to coding and communication
- A survey on spherical designs and algebraic combinatorics on spheres
- Bounds on codes derived by counting components in Varshamov graphs
- On Lagrangian-Grassmannian codes
- Codes and caps from orthogonal Grassmannians
- Bounds on packings of spheres in the Grassmann manifold
- Codes and anticodes in the Grassman graph
- Linear programming bounds for codes in grassmannian spaces
This page was built for publication: A bound on Grassmannian codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855863)
