Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
نویسندگان
چکیده
منابع مشابه
Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff
A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that can be simultaneously achieved by a space-time (ST) block code. This tradeoff is precisely known in the case of i.i.d. Rayleigh-fading, for T ≥ nt + nr − 1 ...
متن کاملExplicit, Minimum-Delay Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff
In the recent landmark paper of Zheng and Tse it is shown that there exists a fundamental tradeoff between diversity gain and multiplexing gain, referred to as the DiversityMultiplexing gain(D-MG) tradeoff. The present paper presents the first explicit construction of space-time (ST) codes for arbitrary number of transmit antennas that achieve the D-MG tradeoff. It is shown here that ST codes w...
متن کاملExplicit Capacity-achieving Codes for Worst-Case Additive Errors
For every p ∈ (0, 1/2), we give an explicit construction of binary codes of rate approaching “capacity” 1−H(p) that enable reliable communication in the presence of worst-case additive errors, caused by a channel oblivious to the codeword (but not necessarily the message). Formally, we give an efficient “stochastic” encoding E(·, ·) of messages combined with a small number of auxiliary random b...
متن کاملSpace-time codes achieving the DMD tradeoff of the MIMO-ARQ channel
For the quasi-static, Rayleigh-fading multiple-input multiple-output (MIMO) channel with transmit and receive antennas, Zheng and Tse showed that there exists a fundamental tradeoff between diversity and spatial-multiplexing gains, referred to as the diversity–multiplexing gain (D-MG) tradeoff. Subsequently, El Gamal, Caire, and Damen considered signaling across the same channel using an -round...
متن کاملExplicit Capacity-Achieving List-Decodable Codes or Decoding Folded Reed-Solomon Codes up to their Distance
For every 0 < R < 1 and ε > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 − R − ε) of errors. These codes achieve the “capacity” for decoding from adversarial errors, i.e., achieve the optimal trade-off between rate and error-correction radius. At least theoretically, this meets one of the central chall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2006
ISSN: 0018-9448
DOI: 10.1109/tit.2006.880037