Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission

For pt.I see ibid., vol.45, no.2, p.742-9 (1999). We consider an arbitrarily varying multiple-access channel (AVMAC) W which the two senders x and y observe, respectively, the components K/sup m/ and L/sup m/ of a memoryless correlated source (MCS) {(K/sup m/, L/sup m/)}/sub m//sup /spl infin//=1 with generic rv's (K, L). In part I of this work, it has been shown for the AVMAC without the MCS that in order for the achievable rate region for deterministic codes and the average probability of error criterion to be nonempty, it was sufficient if the AVC were x nonsymmetrizable, y nonsymmetrizable, and xy nonsymmetrizable. (The necessity of these conditions had been shown earlier by Gubner (1990).) Let R/sub R/(W) denote the random code achievable rate region of the AVMAC W. In the present paper, the authors, in effect, trade the loss in achievable rates due to symmetrizability off the gains provided by the MCS. Let R(W, (K, L)) represent the achievable rate region of the AVC W with MCS, for deterministic codes and the average probability of error criterion. There are two main results: (1) if I(K/spl and/L)>0, then R(W, (K, L)) has a nonempty interior iff R/sub R/(W) does too and W is xy nonsymmetrizable; and (2) if I(K/spl and/L)>0, H(K|L)>0,H(L|K)>0 then the MCS can be transmitted over the AVMAC iff R/sub R/(W) has a nonempty interior and W is xy nonsymmetrizable.

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

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

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

[4]  Rudolf Ahlswede,et al.  A method of coding and its application to arbitrarily varying channels , 1980 .

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

[6]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

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

[8]  Rudolf Ahlswede,et al.  On source coding with side information via a multiple-access channel and related problems in multi-user information theory , 1983, IEEE Trans. Inf. Theory.

[9]  R. Ahlswede The Capacity Region of a Channel with Two Senders and Two Receivers , 1974 .

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

[11]  Masoud Salehi,et al.  Multiple access channels with arbitrarily correlated sources , 1980, IEEE Trans. Inf. Theory.

[12]  Rudolf Ahlswede,et al.  Two proofs of Pinsker's conjecture concerning arbitrarily varying channels , 1991, IEEE Trans. Inf. Theory.

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

[14]  I. Csiszár,et al.  On the capacity of the arbitrarily varying channel for maximum probability of error , 1981 .