MacWilliams identity for codes with the rank metric
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
Rank q-cyclic and pseudo-q-cyclic codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Constant-rank codes and their connection to constant-dimension codes
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
The critical design criterion for space-time codes in asymptotically good channels is the minimum rank between codeword pairs. Rank codes are a two-dimensional matrix code construction where by the rank is the metric of merit. We look at the application of rank codes to space-time code design. In particular, we provide construction methods of full-rank codes over different complex signal constellations, for arbitrary numbers of antennas, and codeword periods. We also derive a Singleton-type bound on the rate of a code for the rank metric, and we show that rank codes satisfy this bound with equality.