Broadcast Channel Synthesis from Shared Randomness
Information Theory
2024-05-09 v1 math.IT
Abstract
We study the problem of synthesising a two-user broadcast channel using a common message, where each output terminal shares an independent source of randomness with the input terminal. This generalises two problems studied in the literature (Cuff, IEEE Trans. Inform. Theory, 2013; Kurri et.al., IEEE Trans. Inform. Theory, 2021). We give an inner bound on the tradeoff region between the rates of communication and shared randomness, and a lower bound on the minimum communication rate. Although the bounds presented here are not tight in general, they are tight for some special cases, including the aforementioned problems.
Cite
@article{arxiv.2405.05211,
title = {Broadcast Channel Synthesis from Shared Randomness},
author = {Malhar A. Managoli and Vinod M. Prabhakaran},
journal= {arXiv preprint arXiv:2405.05211},
year = {2024}
}