A Multiway Relay Channel with Balanced Sources

Abstract

We consider a joint source-channel coding problem on a finite-field multiway relay channel, and we give closed-form lower and upper bounds on the optimal source-channel rate. These bounds are shown to be tight for all discrete memoryless sources in a certain class ${\mathcal{P}}^{\ast }$, and we demonstrate that strict source-channel separation is optimal within this class. We show how to test whether a given source belongs to ${\mathcal{P}}^{\ast }$, we give a balanced-information regularity condition for ${\mathcal{P}}^{\ast }$, and we express ${\mathcal{P}}^{\ast }$ in terms of conditional multiple-mutual informations. Finally, we show that ${\mathcal{P}}^{\ast }$ is useful for a centralised storage problem.

Author final manuscript

References in corpus (4)

• The Capacity Region of Multiway Relay Channels Over Finite Fields with Full Data Exchange
• Information-Theoretic Caching: Sequential Coding for Computing
• Multi-Way Relay Networks: Orthogonal Uplink, Source-Channel Separation and Code Design
• The Capacity Region of Restricted Multi-Way Relay Channels with Deterministic Uplinks