A bound on Grassmannian codes

Details A bound on Grassmannian codes A bound on Grassmannian codes

2005-12-06

arxiv.org/abs/cs/0512024v1

Problems of Information Transmission, 2006, vol. 42, no. 2, pp. 77---89

Computer Science

Information Theory

5 pages, submitted

Scientific paper

10.1134/S0032946006020025

We give a new asymptotic upper bound on the size of a code in the
Grassmannian space. The bound is better than the upper bounds known previously
in the entire range of distances except very large values.

Affiliated with

Also associated with

No associations

Rating

A bound on Grassmannian codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A bound on Grassmannian codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A bound on Grassmannian codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-697608