Decoder Error Probability of MRD Codes

Simple item page
dc.creatorGadouleau, Maximilien
dc.creatorYan, Zhiyuan
dc.date2006-10-26
dc.date.accessioned2026-07-07T08:16:47Z
dc.date.available2026-07-07T08:16:47Z
dc.descriptionIn 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.
dc.description6 pages, 2 figures. Presented at ITW 2006, Chengdu, China
dc.identifierhttps://arxiv.org/abs/cs/0610148
dc.identifierhttp://arxiv.org/abs/cs/0610148
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133901
dc.subjectInformation Theory
dc.titleDecoder Error Probability of MRD Codes
dc.typetext

Files

Collections

arXiv