Maximum rank distance codes as space-time codes
P Lusina, E Gabidulin, M Bossert - IEEE Transactions on …, 2003 - ieeexplore.ieee.org
P Lusina, E Gabidulin, M Bossert
IEEE Transactions on Information Theory, 2003•ieeexplore.ieee.orgThe 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 …
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 …
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.
ieeexplore.ieee.org
Showing the best result for this search. See all results