By Topic

Codes Over Matrix Rings for Space-Time Coded Modulations

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
$31 $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)
Oggier, F. ; Sch. of Phys. & Math. Sci., Nanyang Technol. Univ., Singapore, Singapore ; Sole, P. ; Belfiore, J.-C.

It is known that, for transmission over quasi-static MIMO fading channels with n transmit antennas, diversity can be obtained by using an inner fully diverse space-time block code while coding gain, derived from the determinant criterion, comes from an appropriate outer code. When the inner code has a cyclic algebra structure over a number field, as for perfect space-time codes, an outer code can be designed via coset coding, more precisely, by taking the quotient of the algebra by a two-sided ideal which leads to matrices over finite alphabets for the outer code. In this paper, we show that the determinant criterion induces various metrics on the outer code, such as the Hamming and Bachoc distances. When n = 2, partitioning the 2×2 Golden code by using an ideal above the prime 2 leads to consider codes over either M2(F2) or M2(F2 [i]), both being noncommutative alphabets. By identifying them as algebras over a finite field or a finite ring respectively, we establish an unexpected connection with classical error-correcting codes over F4 and F4 [i]. Matrix rings of higher dimension, suitable for 3×3 and 4×4 perfect codes, give rise to more complex examples.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 2 )