Bounds on Covering Codes with the Rank Metric

Details Bounds on Covering Codes with the Rank Metric Bounds on Covering Codes with the Rank Metric

2008-09-17

arxiv.org/abs/0809.2968v2

Computer Science

Information Theory

8 pages, 1 table, extended version with all the proofs

Scientific paper

In this paper, we investigate geometrical properties of the rank metric space and covering properties of rank metric codes. We first establish an analytical expression for the intersection of two balls with rank radii, and then derive an upper bound on the volume of the union of multiple balls with rank radii. Using these geometrical properties, we derive both upper and lower bounds on the minimum cardinality of a code with a given rank covering radius. The geometrical properties and bounds proposed in this paper are significant to the design, decoding, and performance analysis of rank metric codes.

Affiliated with

Also associated with

No associations

Rating

Bounds on Covering 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 Bounds on Covering Codes with the Rank Metric, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on Covering Codes with the Rank Metric will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-661864