Broadcasting Information subject to State Masking
Michael Dikshtein, Shlomo Shamai

TL;DR
This paper investigates coding strategies for a broadcast channel with random parameters, focusing on state masking constraints, and provides tight bounds for Gaussian channels with private messages.
Contribution
It derives inner and outer bounds for the capacity region of broadcast channels with state masking, including a tight characterization for Gaussian channels.
Findings
Inner and outer bounds on achievable rates derived.
Bounds are tight for Gaussian broadcast channels with private messages.
Provides new insights into state masking in broadcast communication.
Abstract
We study the problem of coding over a general discrete memoryless broadcast channel controlled by random parameters. The parameters are available at the transmitter in a non-causal manner and are subject to a state masking constraint on the receivers. We derive inner and outer bounds on the achievable region and show that for the special case of Gaussian broadcast channel with private messages, these bounds are tight.
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.
