Computer Science – Information Theory
Scientific paper
2006-10-16
Computer Science
Information Theory
5 pages, 4 figures, accepted to Globecom 2006
Scientific paper
In this paper, we study properties of rank metric codes in general and maximum rank distance (MRD) codes in particular. For codes with the rank metric, we first establish Gilbert and sphere-packing bounds, and then obtain the asymptotic forms of these two bounds and the Singleton bound. Based on the asymptotic bounds, we observe that asymptotically Gilbert-Varsharmov bound is exceeded by MRD codes and sphere-packing bound cannot be attained. We also establish bounds on the rank covering radius of maximal codes, and show that all MRD codes are maximal codes and all the MRD codes known so far achieve the maximum rank covering radius.
Gadouleau Maximilien
Yan Zhiyuan
No associations
LandOfFree
Properties of Codes with the Rank Metric 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 Properties of Codes with the Rank Metric, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Properties of Codes with the Rank Metric will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-390378