Home > Research > Publications & Outputs > Rank codes over Gaussian integers and space tim...
View graph of relations

Rank codes over Gaussian integers and space time block codes

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

Rank codes over Gaussian integers and space time block codes. / Asif, Hafiz; Gabidulin, E. M.; Honary, Bahram.
Mathematics of Distances and Applications (MDA). ed. / Michel Deza; Michel Petitjean; Krassimir Markov. Sofia: ITHEA, 2012. p. 11-11.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Asif, H, Gabidulin, EM & Honary, B 2012, Rank codes over Gaussian integers and space time block codes. in M Deza, M Petitjean & K Markov (eds), Mathematics of Distances and Applications (MDA). ITHEA, Sofia, pp. 11-11, International Conference Mathematics of Distances and Applications, Varna, Bulgaria, 2/07/12. <http://www.foibg.com/conf/ITA2012/MDA2012_Abstracts_Book.pdf>

APA

Asif, H., Gabidulin, E. M., & Honary, B. (2012). Rank codes over Gaussian integers and space time block codes. In M. Deza, M. Petitjean, & K. Markov (Eds.), Mathematics of Distances and Applications (MDA) (pp. 11-11). ITHEA. http://www.foibg.com/conf/ITA2012/MDA2012_Abstracts_Book.pdf

Vancouver

Asif H, Gabidulin EM, Honary B. Rank codes over Gaussian integers and space time block codes. In Deza M, Petitjean M, Markov K, editors, Mathematics of Distances and Applications (MDA). Sofia: ITHEA. 2012. p. 11-11

Author

Asif, Hafiz ; Gabidulin, E. M. ; Honary, Bahram. / Rank codes over Gaussian integers and space time block codes. Mathematics of Distances and Applications (MDA). editor / Michel Deza ; Michel Petitjean ; Krassimir Markov. Sofia : ITHEA, 2012. pp. 11-11

Bibtex

@inproceedings{4180db7de6714819803f3aa10fd17a17,
title = "Rank codes over Gaussian integers and space time block codes",
abstract = "Maximum rank distance (MRD) codes have been used for the construction of space time block code (STBC) using a matrix method. Like orthogonal STBC{\textquoteright}s in most popular cases, MRDSTBC{\textquoteright}s can also achieve full diversity. Though an OSTBC is known to yield the best BER performance, a unique case is described where MRDSTBC performs better than Alamouti code (OSTBC). Moreover, the viability of Gabidulin{\textquoteright}s decoding algorithm has been established by decoding complex symbols generated from MRD-STBC{\textquoteright}s. Under this decoding scheme, MRDSTBC{\textquoteright}s have been shown to be preferred candidate for higher antenna configuration as the decoding complexity ofGabidulin{\textquoteright}s algorithm is far less than that of maximum likelihood (ML) decoding algorithm.",
author = "Hafiz Asif and Gabidulin, {E. M.} and Bahram Honary",
year = "2012",
month = jul,
language = "English",
isbn = "978-954-16-2019-9",
pages = "11--11",
editor = "Michel Deza and Michel Petitjean and Krassimir Markov",
booktitle = "Mathematics of Distances and Applications (MDA)",
publisher = "ITHEA",
note = "International Conference Mathematics of Distances and Applications ; Conference date: 02-07-2012 Through 05-07-2012",

}

RIS

TY - GEN

T1 - Rank codes over Gaussian integers and space time block codes

AU - Asif, Hafiz

AU - Gabidulin, E. M.

AU - Honary, Bahram

PY - 2012/7

Y1 - 2012/7

N2 - Maximum rank distance (MRD) codes have been used for the construction of space time block code (STBC) using a matrix method. Like orthogonal STBC’s in most popular cases, MRDSTBC’s can also achieve full diversity. Though an OSTBC is known to yield the best BER performance, a unique case is described where MRDSTBC performs better than Alamouti code (OSTBC). Moreover, the viability of Gabidulin’s decoding algorithm has been established by decoding complex symbols generated from MRD-STBC’s. Under this decoding scheme, MRDSTBC’s have been shown to be preferred candidate for higher antenna configuration as the decoding complexity ofGabidulin’s algorithm is far less than that of maximum likelihood (ML) decoding algorithm.

AB - Maximum rank distance (MRD) codes have been used for the construction of space time block code (STBC) using a matrix method. Like orthogonal STBC’s in most popular cases, MRDSTBC’s can also achieve full diversity. Though an OSTBC is known to yield the best BER performance, a unique case is described where MRDSTBC performs better than Alamouti code (OSTBC). Moreover, the viability of Gabidulin’s decoding algorithm has been established by decoding complex symbols generated from MRD-STBC’s. Under this decoding scheme, MRDSTBC’s have been shown to be preferred candidate for higher antenna configuration as the decoding complexity ofGabidulin’s algorithm is far less than that of maximum likelihood (ML) decoding algorithm.

M3 - Conference contribution/Paper

SN - 978-954-16-2019-9

SP - 11

EP - 11

BT - Mathematics of Distances and Applications (MDA)

A2 - Deza, Michel

A2 - Petitjean, Michel

A2 - Markov, Krassimir

PB - ITHEA

CY - Sofia

T2 - International Conference Mathematics of Distances and Applications

Y2 - 2 July 2012 through 5 July 2012

ER -