The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders

We derive the capacity region of arbitrarily varying multiple-access channels (AV-MACs) with conferencing encoders for both deterministic and random coding. For a complete description, it is sufficient that one conferencing capacity is positive. We obtain a dichotomy: either the channel's deterministic capacity region is zero or it equals the 2-D random coding region. We determine exactly when either case holds. We also discuss the benefits of conferencing. We give the example of an AV-MAC which does not achieve any nonzero rate pair without encoder cooperation, but the 2-D random coding capacity region if conferencing is possible. Unlike compound multiple-access channels, arbitrarily varying multiple-access channels may exhibit a discontinuous increase of the capacity region when conferencing in at least one direction is enabled.

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

[2]  Holger Boche,et al.  Capacity Results for Arbitrarily Varying Wiretap Channels , 2012, Information Theory, Combinatorics, and Search Theory.

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

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

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

[6]  Moritz Wiese,et al.  The arbitrarily varying multiple-access channel with conferencing encoders , 2011, ISIT.

[7]  Shlomo Shamai,et al.  Message and State Cooperation in Multiple Access Channels , 2010, IEEE Transactions on Information Theory.

[8]  Angela Michèle Wigger,et al.  Cooperation on the Multiple-Access Channel , 2008 .

[9]  Frans M. J. Willems,et al.  The discrete memoryless multiple access channel with partially cooperating encoders , 1983, IEEE Trans. Inf. Theory.

[10]  John A. Gubner.  Deterministic Codes for Arbitrarily Varying Multiple-Access Channels , 1988 .

[11]  Rudolf Ahlswede,et al.  Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True , 1997, IEEE Trans. Inf. Theory.

[12]  Moritz Wiese,et al.  The Compound Multiple Access Channel With Partially Cooperating Encoders , 2011, IEEE Transactions on Information Theory.

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

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

[15]  Amos Lapidoth,et al.  The Gaussian MAC with conferencing encoders , 2008, 2008 IEEE International Symposium on Information Theory.

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

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

[18]  Shlomo Shamai,et al.  Compound Multiple-Access Channels With Partial Cooperation , 2008, IEEE Transactions on Information Theory.

[19]  V. Jungnickel,et al.  Coordinated Multipoint Trials in the Downlink , 2009, 2009 IEEE Globecom Workshops.

[20]  Roy D. Yates,et al.  Capacity of Interference Channels With Partial Transmitter Cooperation , 2007, IEEE Transactions on Information Theory.

[21]  Graeme Smith,et al.  Quantum Communication with Zero-Capacity Channels , 2008, Science.