TY - GEN
T1 - Capacity Region of the Gaussian Arbitrarily-Varying Broadcast Channel
AU - Hosseinigoki, Fatemeh
AU - Kosut, Oliver
N1 - Funding Information:
This material is based upon work supported by the National Science Foundation under Grant No. CCF-1453718.
Funding Information:
ACKNOWLEDGMENT This material is based upon work supported by the National Science Foundation under Grant No. CCF-1453718.
PY - 2020/6
Y1 - 2020/6
N2 - This paper considers the two-user Gaussian arbitrarily-varying broadcast channel, wherein a power-limited transmitter wishes to send a message to each of two receivers. Each receiver sees a superposition of the transmitter's sequence, Gaussian noise, and a signal from a power-limited malicious jammer. The jammer is assumed to know the code, but is oblivious to real-time transmissions. The exact capacity region of this setting is determined to be the capacity region of the standard Gaussian broadcast channel, but with the noise variance increased by the power of the jammer, as long as the received power of the jammer at each receiver is less than that of the legitimate transmitter. A key aspect of the achievable scheme involves sharing randomness from the transmitter to the receivers by breaking the transmitted sequence into segments, and either transmitting at full power in a segment, or sending zero. By coding over the on/off signal, a small shared randomness can be established without corruption by the jammer, and without interfering with the standard superposition coding strategy for the Gaussian broadcast channel.
AB - This paper considers the two-user Gaussian arbitrarily-varying broadcast channel, wherein a power-limited transmitter wishes to send a message to each of two receivers. Each receiver sees a superposition of the transmitter's sequence, Gaussian noise, and a signal from a power-limited malicious jammer. The jammer is assumed to know the code, but is oblivious to real-time transmissions. The exact capacity region of this setting is determined to be the capacity region of the standard Gaussian broadcast channel, but with the noise variance increased by the power of the jammer, as long as the received power of the jammer at each receiver is less than that of the legitimate transmitter. A key aspect of the achievable scheme involves sharing randomness from the transmitter to the receivers by breaking the transmitted sequence into segments, and either transmitting at full power in a segment, or sending zero. By coding over the on/off signal, a small shared randomness can be established without corruption by the jammer, and without interfering with the standard superposition coding strategy for the Gaussian broadcast channel.
UR - http://www.scopus.com/inward/record.url?scp=85090424390&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85090424390&partnerID=8YFLogxK
U2 - 10.1109/ISIT44484.2020.9174108
DO - 10.1109/ISIT44484.2020.9174108
M3 - Conference contribution
AN - SCOPUS:85090424390
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1007
EP - 1011
BT - 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2020 IEEE International Symposium on Information Theory, ISIT 2020
Y2 - 21 July 2020 through 26 July 2020
ER -