By Topic

Maximum rank distance codes as space-time codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
P. Lusina ; Dept. for Telecommun. & Appl. Inf. Theor., Univ. of Ulm, Germany ; E. Gabidulin ; M. Bossert

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.

Published in:

IEEE Transactions on Information Theory  (Volume:49 ,  Issue: 10 )