Login / Signup
Density and bounds for Grassmannian codes with chordal distance.
Renaud-Alexandre Pitaval
Olav Tirkkonen
Steven D. Blostein
Published in:
ISIT (2011)
Keyphrases
</>
upper bound
lower bound
distance measure
lower and upper bounds
worst case
error correction
minimum distance
similarity measure
subspace learning
tight bounds