TY - GEN
T1 - Capacity for classes of broadcast channels with receiver side information
AU - Kramer, Gerhard
AU - Shamai, Shlomo
PY - 2007
Y1 - 2007
N2 - Methods are developed that achieve all rate points inside the capacity region of two-receiver memoryless broadcast channels where each receiver knows the message it need not decode. The capacity result generalizes to channels with perletter average cost constraints, e.g., additive white Gaussian noise channels with power constraints. The result further generalizes to cases where the receivers have only partial message information and where one receiver must decode both messages.
AB - Methods are developed that achieve all rate points inside the capacity region of two-receiver memoryless broadcast channels where each receiver knows the message it need not decode. The capacity result generalizes to channels with perletter average cost constraints, e.g., additive white Gaussian noise channels with power constraints. The result further generalizes to cases where the receivers have only partial message information and where one receiver must decode both messages.
UR - https://www.scopus.com/pages/publications/46749104134
U2 - 10.1109/ITW.2007.4313093
DO - 10.1109/ITW.2007.4313093
M3 - Conference contribution
AN - SCOPUS:46749104134
SN - 1424415640
SN - 9781424415649
T3 - 2007 IEEE Information Theory Workshop, ITW 2007, Proceedings
SP - 313
EP - 318
BT - 2007 IEEE Information Theory Workshop, ITW 2007, Proceedings
T2 - 2007 IEEE Information Theory Workshop, ITW 2007
Y2 - 2 September 2007 through 6 September 2007
ER -