MacWilliams identity for codes with the rank metric
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
Construction and covering properties of constant-dimension codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Decoder error probability of bounded distance decoders for constant-dimension codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Packing and covering properties of subspace codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Packing and covering properties of subspace codes for error control in random linear network coding
IEEE Transactions on Information Theory
Constant-rank codes and their connection to constant-dimension codes
IEEE Transactions on Information Theory
Asymptotic behaviour of codes in rank metric over finite fields
Designs, Codes and Cryptography
Hi-index | 754.96 |
In this correspondence, 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 , the decoder error probability of bounded rank distance decoders decreases exponentially with based on the assumption that all errors with the same rank are equally likely.