Abstract
If senders and a receiver of an arbitrarily varying multiple-access channel (AV-MAC) have access to outputs of discrete correlated memoryless sources, the same rate region is achievable as if common randomness were available, no matter how small the correlation is. This reduces the necessary amount of cooperation in an AV-MAC considerably. Moreover, to transmit blocklength-n words, no more than order log n source outputs are required.
Similar content being viewed by others
References
Ahlswede, R., Elimination of Correlation in Random Codes for Arbitrarily Varying Channels, Z. Wahrsch. Verw. Gebiete, 1978, vol. 44, no. 2, pp. 159–175.
Csiszár, I. and Narayan, P., The Capacity of the Arbitrarily Varying Channel Revisited: Positivity, Constraints, IEEE Trans. Inform. Theory, 1988, vol. 34, no. 2, pp. 181–193.
Ericson, T., Exponential Error Bounds for Random Codes in the Arbitrarily Varying Channel, IEEE Trans. Inform. Theory, 1985, vol. 31, no. 1, pp. 42–48.
Willems, F.M.J., Informationtheoretical Results for the Discrete Memoryless Multiple Access Channel, PhD Thesis, Leuven, Belgium: Katholieke Univ. Leuven, 1982.
Willems, F.M.J., The Discrete Memoryless Multiple Access Channel with Partially Cooperating Encoders, IEEE Trans. Inform. Theory, 1983, vol. 29, no. 3, pp. 441–445.
Wiese, M. and Boche, H., The Arbitrarily Varying Multiple-Access Channel with Conferencing Encoders, IEEE Trans. Inform. Theory, 2013, vol. 59, no. 3, pp. 1405–1416.
Gubner, J.A., On the Deterministic-Code Capacity of the Multiple-Access Arbitrarily Varying Channel, IEEE Trans. Inform. Theory, 1990, vol. 36, no. 2, pp. 262–275.
Ahlswede, R. and Cai, N., Correlated Sources Help Transmission over an Arbitrarily Varying Channel, IEEE Trans. Inform. Theory, 1997, vol. 43, no. 4, pp. 1254–1255.
Ahlswede, R. and Cai, N., Arbitrarily Varying Multiple-Access Channels. I. Ericson’s Symmetrizability Is Adequate, Gubner’s Conjecture Is True, IEEE Trans. Inform. Theory, 1999, vol. 45, no. 2, pp. 742–749.
Boche, H. and Nötzel, J., Arbitrarily Small Amounts of Correlation for Arbitrarily Varying Quantum Channels, arXiv:1301.6063v2 [quant-ph], 2013. To appear in J. Math. Phys.
Blinovsky, V.M., Narayan, P., and Pinsker, M.S., Capacity of the Arbitrarily Varying Channel under List Decoding, Probl. Peredachi Inf., 1995, vol. 31, no. 2, pp. 3–19 [Probl. Inf. Trans. (Engl. Transl.), 1995, vol. 31, no. 2, pp. 99–113].
Wiese, M. and Boche, H., Strong Secrecy for Multiple Access Channels, Information Theory, Combinatorics, and Search Theory. In Memory of Rudolf Ahlswede, Aydinian, H.K., Cicalese, F., and Deppe, C., Eds., Lect. Notes Comp. Sci., vol. 7777, Berlin: Springer, 2013, pp. 71–122.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © M. Wiese, H. Boche, 2014, published in Problemy Peredachi Informatsii, 2014, Vol. 50, No. 1, pp. 18–30.
Supported in part by the German National Science Foundation (DFG), project nos. BO 1734/23-1 and BO 1734/24-1, in the COIN Focus Program.
Rights and permissions
About this article
Cite this article
Wiese, M., Boche, H. On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders. Probl Inf Transm 50, 15–26 (2014). https://doi.org/10.1134/S0032946014010025
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946014010025