Computer Science – Information Theory
Scientific paper
2007-01-16
Computer Science
Information Theory
23 pages, 1 table. Submitted to IEEE Transactions on Information Theory
Scientific paper
This paper investigates packing and covering properties of codes with the
rank metric. First, we investigate packing properties of rank metric codes.
Then, we study sphere covering properties of rank metric codes, derive bounds
on their parameters, and investigate their asymptotic covering properties.
Gadouleau Maximilien
Yan Zhiyuan
No associations
LandOfFree
Packing and Covering Properties of Rank Metric 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 Packing and Covering Properties of Rank Metric Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packing and Covering Properties of Rank Metric Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-188713