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
Close
Publication date07/2012
Host publicationMathematics of Distances and Applications (MDA)
EditorsMichel Deza, Michel Petitjean, Krassimir Markov
Place of PublicationSofia
PublisherITHEA
Pages11-11
Number of pages1
ISBN (electronic)978-954-16-2020-5
ISBN (print)978-954-16-2019-9
<mark>Original language</mark>English
EventInternational Conference Mathematics of Distances and Applications - Varna, Bulgaria
Duration: 2/07/20125/07/2012

Conference

ConferenceInternational Conference Mathematics of Distances and Applications
Country/TerritoryBulgaria
CityVarna
Period2/07/125/07/12

Conference

ConferenceInternational Conference Mathematics of Distances and Applications
Country/TerritoryBulgaria
CityVarna
Period2/07/125/07/12

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’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 of
Gabidulin’s algorithm is far less than that of maximum likelihood (ML) decoding algorithm.