On the Equivalence of Two Achievable Regions for the Broadcast Channel
Lists
Only you see this
Abstract
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.
BibTeX
@article{liang2011equivalence,
author = {Yingbin Liang and Gerhard Kramer and H. Vincent Poor},
title = {{On the Equivalence of Two Achievable Regions for the Broadcast Channel}},
journal = {IEEE Trans. Information Theory},
year = {2011},
url = {https://openreview.net/forum?id=3Gjw0gGqGf},
}Loading related content...