On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum Rank Distance Codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. We then use elementary linear subspaces to derive properties of maximum rank distance (MRD) codes that parallel those of maximum distance separable codes. Using these properties, we show that, for MRD codes with error correction capability t, the decoder error probability of bounded rank distance decoders decreases exponentially with t^2 based on the assumption that all errors with the same rank are equally likely.
5 pages. To appear in IEEE Transactions on Information Theory

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/155977

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0612051
 http://arxiv.org/abs/cs/0612051

Collections

arXiv