Title :
A bound on Grassmannian codes
Author :
Barg, Alexander ; Nogin, Dmitry
Author_Institution :
Dept. of ECE, Maryland Univ., College Park, MD
Abstract :
We derive a new upper bound on the size of a code in the Grassmannian space. The bound is asymptotically better than the upper bounds known previously in the entire range of distances except very large values
Keywords :
codes; Grassmannian codes; Grassmannian space; Array signal processing; Educational institutions; Feedback; MIMO; Quantization; Radio access networks; Rayleigh channels; Strontium; Transmitters; Upper bound;
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
DOI :
10.1109/ISIT.2006.261877
