The Arbitrarily Varying Broadcast Channel With Causal Side Information at the Encoder

In this paper, we study the arbitrarily varying broadcast channel (AVBC) when the state information is available at the transmitter in a causal manner. We establish the inner and outer bounds on both the random code capacity region and the deterministic code capacity region with degraded message sets. The capacity region is then determined for a class of channels satisfying a condition on the mutual information between the strategy variables and the channel outputs. As an example, we consider the arbitrarily varying binary symmetric broadcast channel. We show the cases where the condition holds and, hence, the capacity region is determined and other cases where there is a gap between the bounds. This gap shows that the minimax theorem does not hold for rate regions.

[1]  Rudolf Ahlswede,et al.  Coloring hypergraphs: A new approach to multi-user source coding, 1 , 1979 .

[2]  Viswanathan Ramachandran State-Dependent Degraded Broadcast Channels with Non-Causal Encoder Side Information , 2017 .

[3]  Shlomo Shamai,et al.  Information theoretic considerations for cellular mobile radio , 1994 .

[4]  E. Hof,et al.  On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel with Degraded Message Sets , 2006, 2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel.

[5]  G. Padmavathi,et al.  A Survey of Attacks, Security Mechanisms and Challenges in Wireless Sensor Networks , 2009, ArXiv.

[6]  Gregory W. Wornell,et al.  Quantization index modulation: A class of provably good methods for digital watermarking and information embedding , 2001, IEEE Trans. Inf. Theory.

[7]  Xianglin Wei,et al.  Localization of Directional Jammer in Wireless Sensor Networks , 2018, 2018 International Conference on Robots & Intelligent System (ICRIS).

[8]  Neri Merhav,et al.  Identification in the presence of side information with application to watermarking , 2001, IEEE Trans. Inf. Theory.

[9]  Shlomo Shamai,et al.  Achievable rates for the broadcast channel with states known at the transmitter , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[10]  B. V. K. Vijaya Kumar,et al.  Writing on dirty flash memory , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[12]  Thomas M. Cover,et al.  Comments on Broadcast Channels , 1998, IEEE Trans. Inf. Theory.

[13]  Robert G. Gallager,et al.  Capacity and coding for degraded broadcast channels , 1974 .

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

[15]  Abbas El Gamal,et al.  The feedback capacity of degraded broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[16]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[17]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[18]  Yossef Steinberg,et al.  The Arbitrarily Varying Channel Under Constraints With Side Information at the Encoder , 2019, IEEE Transactions on Information Theory.

[19]  Rudolf Ahlswede,et al.  Source coding with side information and a converse for degraded broadcast channels , 1975, IEEE Trans. Inf. Theory.

[20]  Amos Lapidoth,et al.  Semi-Robust Communications Over a Broadcast Channel , 2017, IEEE Transactions on Information Theory.

[21]  Robert Simon,et al.  A multi-channel defense against jamming attacks in wireless sensor networks , 2007, Q2SWinet '07.

[22]  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.

[23]  H. Vincent Poor,et al.  On the Continuity of the Secrecy Capacity of Compound and Arbitrarily Varying Wiretap Channels , 2014, IEEE Transactions on Information Forensics and Security.

[24]  Yossef Steinberg,et al.  Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information , 2005, IEEE Transactions on Information Theory.

[25]  M. Sion On general minimax theorems , 1958 .

[26]  Wayne E. Stark,et al.  On the capacity of channels with unknown interference , 1989, IEEE Trans. Inf. Theory.

[27]  H. Vincent Poor,et al.  On arbitrarily varying wiretap channels for different classes of secrecy measures , 2014, 2014 IEEE International Symposium on Information Theory.

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

[29]  Robert J. McEliece,et al.  Communication in the Presence of Jamming-An Information-Theoretic Approach , 1983 .

[30]  RUDOLF AHLSWEDE Arbitrarily varying channels with states sequence known to the sender , 1986, IEEE Trans. Inf. Theory.

[31]  Aaron D. Wyner,et al.  Channels with Side Information at the Transmitter , 1993 .

[32]  Simon Haykin,et al.  Cognitive radio: brain-empowered wireless communications , 2005, IEEE Journal on Selected Areas in Communications.

[33]  Andrea J. Goldsmith,et al.  Breaking Spectrum Gridlock With Cognitive Radios: An Information Theoretic Perspective , 2009, Proceedings of the IEEE.

[34]  D. Blackwell,et al.  The Capacities of Certain Channel Classes Under Random Coding , 1960 .

[35]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-I , 1973, IEEE Trans. Inf. Theory.

[36]  Jrg Arndt,et al.  Matters Computational: Ideas, Algorithms, Source Code , 2010 .

[37]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[38]  Yossef Steinberg,et al.  The arbitrarily varying channel under constraints with causal side information at the encoder , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[39]  János Körner,et al.  General broadcast channels with degraded message sets , 1977, IEEE Trans. Inf. Theory.

[40]  Shlomo Shamai,et al.  Cognitive interference channels with state information , 2008, 2008 IEEE International Symposium on Information Theory.

[41]  Mohamed-Slim Alouini,et al.  Digital Communication over Fading Channels: Simon/Digital Communications 2e , 2004 .

[42]  Holger Boche,et al.  Capacity results and super-activation for wiretap channels with active wiretappers , 2013, IEEE Transactions on Information Forensics and Security.

[43]  Shlomo Shamai,et al.  A broadcast approach for a single-user slowly fading MIMO channel , 2003, IEEE Trans. Inf. Theory.

[44]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[45]  R. McEliece,et al.  Some Information Theoretic Saddlepoints , 1985 .

[46]  Shlomo Shamai,et al.  On the capacity of some channels with channel state information , 1999, IEEE Trans. Inf. Theory.

[47]  Urbashi Mitra,et al.  Causal State Communication , 2012, IEEE Transactions on Information Theory.

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

[49]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-II , 1973, IEEE Trans. Inf. Theory.

[50]  Shlomo Shamai,et al.  On the Compound Broadcast Channel: Multiple Description Coding and Interference Decoding , 2014, IEEE Transactions on Information Theory.

[51]  Moritz Wiese,et al.  The Arbitrarily Varying Wiretap Channel - Secret Randomness, Stability, and Super-Activation , 2016, IEEE Trans. Inf. Theory.

[52]  Amos Lapidoth,et al.  Partially-Robust Communications over a Noisy Channel , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[53]  J. Nicholas Laneman,et al.  Arbitrary jamming can preclude secure communication , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[54]  Abbas El Gamal,et al.  A Note on the Broadcast Channel With Stale State Information at the Transmitter , 2015, IEEE Transactions on Information Theory.

[55]  Frans M. J. Willems,et al.  Biometric Security from an Information-Theoretical Perspective , 2012, Found. Trends Commun. Inf. Theory.

[56]  A. J. Han Vinck,et al.  On the general defective channel with informed encoder and capacities of some constrained memories , 1994, IEEE Trans. Inf. Theory.

[57]  Samuel Karlin,et al.  Mathematical Methods and Theory in Games, Programming, and Economics , 1961 .

[58]  Aylin Yener,et al.  MIMO Multiple Access Channel With an Arbitrarily Varying Eavesdropper: Secrecy Degrees of Freedom , 2013, IEEE Trans. Inf. Theory.

[59]  Patrick P. Bergmans,et al.  Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[60]  Christian Deppe,et al.  Information Theory, Combinatorics, and Search Theory: in memory of Rudolf Ahlswede , 2013 .

[61]  Shlomo Shamai,et al.  On the capacity of the carbon copying onto dirty paper channel , 2016, 2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE).

[62]  Yossef Steinberg On the broadcast channel with random parameters , 2002, Proceedings IEEE International Symposium on Information Theory,.

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

[64]  Michele A. Wigger,et al.  On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback , 2010, IEEE Transactions on Information Theory.

[65]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[66]  Joseph A. O'Sullivan,et al.  Information-theoretic analysis of information hiding , 2003, IEEE Trans. Inf. Theory.

[67]  Saleh R. Al-Araji,et al.  Novel Approach for Modeling Wireless Fading Channels Using a Finite State Markov Chain , 2017 .

[68]  Abbas El Gamal,et al.  On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.

[69]  Can Emre Koksal,et al.  An information theoretic approach to RF fingerprinting , 2013, 2013 Asilomar Conference on Signals, Systems and Computers.

[70]  G. Kramer,et al.  Capacity results for the discrete memoryless network , 1999, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).

[71]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[72]  Shlomo Shamai,et al.  The Capacity Region of the Degraded Multiple-Input Multiple-Output Compound Broadcast Channel , 2009, IEEE Transactions on Information Theory.

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

[74]  Yuan Luo,et al.  Arbitrarily Varying Wiretap Channel with State Sequence Known or Unknown at the Receiver , 2017, ArXiv.

[75]  Gunter Dueck,et al.  Partial Feedback for Two-Way and Broadcast Channels , 1980, Inf. Control..

[76]  Neri Merhav,et al.  Channel Coding in the Presence of Side Information , 2008, Found. Trends Commun. Inf. Theory.