Published on:
8 May 2024
Primary Category:
Information Theory
Paper Authors:
Malhar A. Managoli,
Vinod M. Prabhakaran
Studies broadcast channel synthesis with independent shared randomness
Gives inner bound on communication/randomness rate tradeoff
Provides lower bound on minimum communication rate
Bounds are tight for some special cases
Synthesizing broadcast channels using shared randomness
This paper studies the problem of synthesizing a two-user broadcast channel using a common message, when the input terminal shares independent randomness with each output terminal. The authors provide inner and lower bounds on the rate tradeoff between communication and shared randomness. These bounds are tight for some special cases like point-to-point channels and channels without inputs studied in prior work.
Common randomness generation with noisy entanglement
A Clear, Approachable Guide to Information Flow in Multi-Channel Systems
Decomposing information in complex systems using communication channels
Secure key generation over wireless channels
Capacity limits of a 2x2 MIMO system under peak power constraints
Downlink tradeoff analysis for integrated sensing and communication
No comments yet, be the first to start the conversation...
Sign up to comment on this paper