State-Dependent DMC with a Causal Helper

2023/04/25 by Lapidoth, Amos, Wang, Ligong
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2304.12687

Abstract

A memoryless state sequence governing the behavior of a memoryless state-dependent channel is to be described causally to an encoder wishing to communicate over said channel. Given the maximal-allowed description rate, we seek the description that maximizes the Shannon capacity. It is shown that the maximum need not be achieved by a memoryless (symbol-by-symbol) description. Such descriptions are, however, optimal when the receiver is cognizant of the state sequence or when the description is allowed to depend on the message. For other cases, a block-Markov scheme with backward decoding is proposed.

Related

• State-Dependent Channels with a Message-Cognizant Helper
• Causal State Communication
• The State-Dependent Channel with a Rate-Limited Cribbing Helper
• Capacity Region of Multiple Access Channel with States Known Noncausally at One Encoder and Only Strictly Causally at the Other Encoder
• Multiaccess Channels with State Known to Some Encoders and Independent Messages