GENp1-1: Properties of Codes with the Rank Metric
Authors:
- Maximilien GadouleauMGMaximilien Gadouleau
- Zhiyuan YanZYZhiyuan Yan
- 1 November 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1930529X,p. 1-5
Abstract
In this paper, we study properties of rank metric codes in general and maximum rank distance (MRD) codes in particular. For codes with the rank metric, we first establish Gilbert and sphere-packing bounds, and then obtain the asymptotic forms of these two bounds and the Singleton bound. Based on the asymptotic bounds, we observe that asymptotically Gilbert-Varsharmov bound is exceeded by MRD codes and sphere-packing bound cannot be attained. We also establish bounds on the rank covering radius of maximal codes, and show that all MRD codes are maximal codes and all the MRD codes known so far achieve the maximum rank covering radius.Keywords
This publication has 12 references indexed in Scilit:
- On subcodes of codes in rank metric2005
- Maximum rank distance codes as space~time codesIEEE Transactions on Information Theory, 2003
- Rate-diversity tradeoff of space-time codes with fixed alphabet and optimal constructions for psk modulationIEEE Transactions on Information Theory, 2003
- Multi-covering radii of codes with rank metric2003
- Full rank distance codes and optimal STBC for BPSK modulation2003
- Column scrambler for the GPT cryptosystemDiscrete Applied Mathematics, 2003
- Ideals over a Non-Commutative Ring and their Application in Cryptology2001
- Space-time codes for high data rate wireless communication: performance criterion and code constructionIEEE Transactions on Information Theory, 1998
- Maximum-rank array codes and their application to crisscross error correctionIEEE Transactions on Information Theory, 1991
- Covering radius---Survey and recent resultsIEEE Transactions on Information Theory, 1985