Broadcast Channel Synthesis from Shared Randomness

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Managoli, Malhar A., Prabhakaran, Vinod M.
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916239331295232
author Managoli, Malhar A.
Prabhakaran, Vinod M.
author_facet Managoli, Malhar A.
Prabhakaran, Vinod M.
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2405_05211
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Broadcast Channel Synthesis from Shared Randomness
Managoli, Malhar A.
Prabhakaran, Vinod M.
Information Theory
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.
title Broadcast Channel Synthesis from Shared Randomness
topic Information Theory
url https://arxiv.org/abs/2405.05211