Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds

DOI10.1109/TIT.2007.915916MaRDI QIDQ3604630zbMATH OpenFDO

Authors Christine Bachoc, Yael Ben-Haim, Simon Litsyn

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0610813

Mathematics Subject Classification ID

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)

Abstract: Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal distance. They stem from upper bounds for codes in products of unit spheres and projective spaces. The new bounds are asymptotically better than the previously known ones.

Recommendations

• A bound on Grassmannian codes
• Sphere-packing bounds in the Grassmann and Stiefel manifolds
• Bounds on packings of spheres in the Grassmann manifold
• Linear programming bounds for codes in grassmannian spaces
• Bounds for codes and designs in complex subspaces

Cited in

(4)

• Linear programming bounds for codes in grassmannian spaces
• An extension of a theorem of Schoenberg to products of spheres
• A bound on Grassmannian codes
• Bounds on packings of spheres in the Grassmann manifold

This page was built for publication: Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604630)