On Universally Decodable Matrices for Space-Time Coding
| dc.creator | Vontobel, Pascal O. | |
| dc.creator | Ganesan, Ashwin | |
| dc.date | 2006-01-17 | |
| dc.date | 2006-04-28 | |
| dc.date.accessioned | 2026-07-07T08:15:51Z | |
| dc.date.available | 2026-07-07T08:15:51Z | |
| dc.description | The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of constructing UDMs is tightly connected to the problem of constructing maximum distance separable (MDS) codes. In this paper, we first study the properties of UDMs in general and then we discuss an explicit construction of a class of UDMs, a construction which can be seen as an extension of Reed-Solomon codes. In fact, we show that this extension is, in a sense to be made more precise later on, unique. Moreover, the structure of this class of UDMs allows us to answer some open conjectures by Tavildar, Viswanath, and Doshi in the positive, and it also allows us to formulate an efficient decoding algorithm for this class of UDMs. It turns out that our construction yields a coding scheme that is essentially equivalent to a class of codes that was proposed by Rosenbloom and Tsfasman. Moreover, we point out connections to so-called repeated-root cyclic codes. | |
| dc.description | Journal version of earlier conference proceedings paper. Submitted on April 27, 2006 | |
| dc.identifier | https://arxiv.org/abs/cs/0601075 | |
| dc.identifier | http://arxiv.org/abs/cs/0601075 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133584 | |
| dc.subject | Information Theory | |
| dc.subject | Discrete Mathematics | |
| dc.title | On Universally Decodable Matrices for Space-Time Coding | |
| dc.type | text |