Approximately universal codes over slow-fading channels

DOI10.1109/TIT.2006.876226zbMath1298.94060arXivcs/0512017MaRDI QIDQ3547700

Saurabha Tavildar, Pramod Viswanath

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0512017

zbMATH Keywords

space-time codesmultiple-input multiple-output (MIMO)fading channeluniversal codesCompound channeldiversity-multiplexing tradeoff

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)

Related Items (3)

On universally decodable matrices for space-time coding ⋮ Higher genus universally decodable matrices (UDMG) ⋮ Hierarchical erasure correction of linear codes

This page was built for publication: Approximately universal codes over slow-fading channels