Cooperative Binning for Semideterministic Channels
arXiv:1508.05149 · doi:10.1109/TIT.2016.2515095
Abstract
The capacity regions of semideterministic multiuser channels, such as the semideterministic relay channel and the multiple access channel with partially cribbing encoders, have been characterized using the idea of partial-decode-forward. However, the requirement to explicitly decode part of the message at intermediate nodes can be restrictive in some settings; for example, when nodes have different side information regarding the state of the channel. In this paper, we generalize this scheme to by building on the observation that explicit recovering of part of the message is not needed to induce cooperation. Instead, encoders can bin their received signals and cooperatively forward the bin index to the decoder. The main advantage of this new scheme is illustrated by considering state-dependent extensions of the aforementioned semideterministic setups. While partial-decode-forward is not applicable in these new setups, cooperative-bin-forward continues to achieve capacity.
arXiv commentsubmitted to IEEE Transactions on Information Theory, presented in part at ISIT 2015; version-2 contains an illustrative example
References in corpus (5)
- Capacity of a Class of Deterministic Relay Channels
- Bounds on the Capacity of the Relay Channel with Noncausal State at Source
- Multiple Access Channels with States Causally Known at Transmitters
- Message and State Cooperation in a Relay Channel When Only the Relay Knows the State
- On Cooperative Multiple Access Channels with Delayed CSI at Transmitters