Communication Subject to State Obfuscation
Résumé
We consider communication over a state-dependent discrete memoryless channel subject to a constraint that requires that the output sequence be nearly independent of the state. We consider three scenarios for the transmitter: where it knows the state, where it does not know the state and can use a stochastic encoder, and where it does not know the state and must use a deterministic encoder. For the state, we assume it to be either independent and identically distributed across channel uses or randomly generated but constant over all channel uses. We present single-letter capacity formulas for all except one combination of the above scenarios, and also solve some illustrative examples.
Domaines
Théorie de l'information [cs.IT]
Origine : Fichiers produits par l'(les) auteur(s)