Decoder Error Probability of MRD Codes

Details Decoder Error Probability of MRD Codes Decoder Error Probability of MRD Codes

2006-10-26

arxiv.org/abs/cs/0610148v1

Computer Science

Information Theory

6 pages, 2 figures. Presented at ITW 2006, Chengdu, China

Scientific paper

In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. Using this new concept, we derive properties of maximum rank distance (MRD) codes that parallel those of maximum distance separable (MDS) codes. Using these properties, we show that the decoder error probability of MRD codes with error correction capability t decreases exponentially with t^2 based on the assumption that all errors with the same rank are equally likely. We argue that the channel based on this assumption is an approximation of a channel corrupted by crisscross errors.

Affiliated with

Also associated with

No associations

Rating

Decoder Error Probability of MRD 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 Decoder Error Probability of MRD Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoder Error Probability of MRD Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-114182