Semi-Robust Communications over a Broadcast Channel
Tibor Keresztfalvi, Amos Lapidoth

TL;DR
This paper determines the capacity region for a broadcast channel with one transmitter and two receivers, where one channel is fixed and the other is arbitrarily varying, focusing on reliable communication of common and private messages.
Contribution
It establishes the deterministic-code capacity region for a broadcast channel with a known DMC and an AVC, addressing the challenge of robust communication.
Findings
Capacity region characterized for the mixed DMC and AVC setup
Achieved reliable decoding of common and private messages under channel variations
Provides theoretical limits for semi-robust broadcast communication
Abstract
We establish the deterministic-code capacity region of a network with one transmitter and two receivers: an "ordinary receiver" and a "robust receiver." The channel to the ordinary receiver is a given (known) discrete memoryless channel (DMC), whereas the channel to the robust receiver is an arbitrarily varying channel (AVC). Both receivers are required to decode the "common message," whereas only the ordinary receiver is required to decode the "private message."
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
