Cooperative Binning for Semideterministic Channels

DOI10.1109/TIT.2016.2515095MaRDI QIDQ2976958zbMATH OpenOpenAlexFDO

Authors Ritesh Kolte, Ayfer Özgür, Haim Permuter

Publication date 28 April 2017

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

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

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

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

e x t i t c o o p e r a t i v e - b i n - f o r w a r d

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.

Cited in

(1)

Cooperative Multi-Sender Index Coding

This page was built for publication: Cooperative Binning for Semideterministic Channels

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