Broadcasting Information subject to State Masking
classification
💻 cs.IT
math.IT
keywords
boundsbroadcastchannelmaskingparametersstatesubjectachievable
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.