Approximately Universal Codes over Slow Fading Channels
| dc.creator | Tavildar, Saurabha | |
| dc.creator | Viswanath, Pramod | |
| dc.date | 2005-12-05 | |
| dc.date | 2005-12-06 | |
| dc.date.accessioned | 2026-07-07T08:15:47Z | |
| dc.date.available | 2026-07-07T08:15:47Z | |
| dc.description | Performance of reliable communication over a coherent slow fading channel at high SNR is succinctly captured as a fundamental tradeoff between diversity and multiplexing gains. We study the problem of designing codes that optimally tradeoff the diversity and multiplexing gains. Our main contribution is a precise characterization of codes that are universally tradeoff-optimal, i.e., they optimally tradeoff the diversity and multiplexing gains for every statistical characterization of the fading channel. We denote this characterization as one of approximate universality where the approximation is in the connection between error probability and outage capacity with diversity and multiplexing gains, respectively. The characterization of approximate universality is then used to construct new coding schemes as well as to show optimality of several schemes proposed in the space-time coding literature. | |
| dc.description | Revised version. Accepted for IEEE Transactions on Information Theory | |
| dc.identifier | https://arxiv.org/abs/cs/0512017 | |
| dc.identifier | http://arxiv.org/abs/cs/0512017 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133563 | |
| dc.subject | Information Theory | |
| dc.title | Approximately Universal Codes over Slow Fading Channels | |
| dc.type | text |