By Topic

Full rank distance codes and optimal STBC for BPSK modulation

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

2 Author(s)
Manoj, K.N. ; Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore, India ; Rajan, B.S.

Viewing the codewords of an [n, k] linear code over a field F(qm) as m×n matrices over Fq by expanding each entry of the codeword with respect to an Fq-basis of F(qm), the rank weight of a codeword is the rank over Fq of the corresponding matrix and the rank of the code is the minimum rank weight among all non-zero codewords. For m≥n-k+1, codes with maximum possible rank distance, called maximum rank distance (MRD) codes have been studied previously. We study codes with maximum possible rank distance for the cases m≤n-k+1, calling them full rank distance (FRD) codes. Generator matrices of FRD codes are characterized.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002