Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

71

Voted

TIT
2011

favoriteEmaildiscussreport

124views more TIT 2011»

On the Equivalence of Two Achievable Regions for the Broadcast Channel

14 years 5 months ago

On the Equivalence of Two Achievable Regions for the Broadcast Channel

Download ee.usc.edu

—A recent inner bound on the capacity region of the two-receiver discrete memoryless broadcast channel is shown to be equivalent to the Marton-Gelfand-Pinsker region. The proof method is based on a result of Gelfand and Pinsker concerning channel input distributions.

Yingbin Liang, Gerhard Kramer, H. Vincent Poor

Real-time Traffic

Capacity Region | Channel Input Distributions | Memoryless Broadcast Channel | TIT 2011 |

claim paper

Related Content

» On the Fading Paper Achievable Region of the Fading MIMO Broadcast Channel

» An Achievable Rate Region for the Broadcast Channel with Feedback

» Lower Bounds on the Capacity Regions of the Relay Channel and the Cooperative RelayBroadca...

» A Generalized TwoWay Relay Channel with Private Information for the Relay

» Optimal Transmission Strategy and Explicit Capacity Region for Broadcast Z Channels

» Cooperative Relay Broadcast Channels

» The Capacity Region of the Degraded FiniteState Broadcast Channel

» Capacity of TwoWay Relay Channel

» On the Capacity of Bidirectional Broadcast Channels under Channel Uncertainty

Post Info
More Details (n/a)

Added	15 May 2011
Updated	15 May 2011
Type	Journal
Year	2011
Where	TIT
Authors	Yingbin Liang, Gerhard Kramer, H. Vincent Poor

Comments (0)