Capacity Region of the Gaussian Arbitrarily-Varying Broadcast Channel

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.

[1]  Hosseinigoki Fatemeh,et al.  The Gaussian interference channel in the presence of a malicious jammer , 2016 .

[2]  R. Ahlswede,et al.  Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true , 1997, Proceedings of IEEE International Symposium on Information Theory.

[3]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[4]  John A. Gubner On the capacity region of the discrete additive multiple-access arbitrarily varying channel , 1992, IEEE Trans. Inf. Theory.

[5]  John A. Gubner On the deterministic-code capacity of the multiple-access arbitrarily varying channel , 1990, IEEE Trans. Inf. Theory.

[6]  R. Ahlswede Elimination of correlation in random codes for arbitrarily varying channels , 1978 .

[7]  Johann-Heinrich Jahn,et al.  Coding of arbitrarily varying multiuser channels , 1981, IEEE Trans. Inf. Theory.

[8]  Yossef Steinberg,et al.  The Arbitrarily Varying Degraded Broadcast Channel with States Known at the Encoder , 2006, 2006 IEEE International Symposium on Information Theory.

[9]  Imre Csiszár,et al.  The capacity of the arbitrarily varying channel revisited: Positivity, constraints , 1988, IEEE Trans. Inf. Theory.

[10]  Thomas H. E. Ericson,et al.  Exponential error bounds for random codes in the arbitrarily varying channel , 1985, IEEE Trans. Inf. Theory.

[11]  Patrick P. Bergmans,et al.  A simple converse for broadcast channels with additive white Gaussian noise (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[12]  Imre Csiszár,et al.  Capacity of the Gaussian arbitrarily varying channel , 1991, IEEE Trans. Inf. Theory.

[13]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[14]  Shraga I. Bross,et al.  On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel With Degraded Message Sets , 2006, IEEE Transactions on Information Theory.

[15]  A. Sridharan Broadcast Channels , 2022 .