Coding strategies for bidirectional relaying for arbitrarily varying channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Bounds of E-capacity for multiple-access channel with random parameter
General Theory of Information Transfer and Combinatorics
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 754.84 |
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 Km and Lm of a memoryless correlated source (MCS) {(Km, L m)}m∞=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 RR(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∧L)>0, then R(W, (K, L)) has a nonempty interior iff RR(W) does too and W is xy nonsymmetrizable; and (2) if I(K∧L)>0, H(K|L)>0,H(L|K)>0 then the MCS can be transmitted over the AVMAC iff RR(W) has a nonempty interior and W is xy nonsymmetrizable