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.

作者: Maximilien Gadouleau Zhiyuan Yan

作者单位: Department of Electrical and Computer Engineering Lehigh University Bethlehem, PA 18015 USA

会议类型: 国际会议

会议名称: 2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)

会议地点: 成都

会议语种:英文

页码: 264-268

在线出版日期: 2006-10-22（万方平台首次上网日期，不代表论文的发表时间）