The Compound Multiple Access Channel With Partially Cooperating Encoders

DOI10.1109/TIT.2011.2119830zbMATH Open1366.94430arXiv1005.0291MaRDI QIDQ5280944FDOQ5280944

Moritz Wiese, Holger Boche, Igor Bjelaković, Volker Jungnickel

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-access channel with an arbitrary number of channel states. The channel state information at the transmitters is such that each transmitter has a finite partition of the set of states and knows which element of the partition the actual state belongs to. The receiver may have arbitrary channel state information. The first coding theorem is for the case that both transmitters have a common message and that each has an additional common message. The second coding theorem is for the case where rate-constrained, but noiseless transmitter cooperation is possible. This cooperation may be used to exchange information about channel state information as well as the messages to be transmitted. The cooperation protocol used here generalizes Willems' conferencing. We show how this models base station cooperation in modern wireless cellular networks used for interference coordination and capacity enhancement. In particular, the coding theorem for the cooperative case shows how much cooperation is necessary in order to achieve maximal capacity in the network considered.

Full work available at URL: https://arxiv.org/abs/1005.0291

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited In (11)

• Message and State Cooperation in Multiple Access Channels
• Impact of interference in coexisting wireless networks with applications to arbitrarily varying bidirectional broadcast channels
• Cooperative Multi-Sender Index Coding
• Successive Refinement With Decoder Cooperation and Its Channel Coding Duals
• Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
• The classical-quantum multiple access channel with conferencing encoders and with common messages
• Multiple-Access Channel With Partial and Controlled Cribbing Encoders
• The Multiple-Access Channel With Partial State Information at the Encoders
• On the Discrete Memoryless Partially Cooperative Relay Broadcast Channel and the Broadcast Channel With Cooperating Decoders
• Strong Secrecy for Multiple Access Channels
• On the Compound Broadcast Channel: Multiple Description Coding and Interference Decoding

This page was built for publication: The Compound Multiple Access Channel With Partially Cooperating Encoders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280944)