Decoder Error Probability of MRD Codes

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 t2 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.

• Type: Journal
• Year: 2006
• Where: CORR
• Authors: Maximilien Gadouleau, Zhiyuan Yan
• Keywords: CORR 2006, Decoder Error Probability, Education, Elementary Linear Subspace, Maximum Rank Distance