تقرير
State-Dependent DMC with a Causal Helper
| العنوان: | State-Dependent DMC with a Causal Helper |
|---|---|
| المؤلفون: | Lapidoth, Amos, Wang, Ligong |
| سنة النشر: | 2023 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Computer Science - Information Theory |
| الوصف: | 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. Comment: To appear in the IEEE Transactions on Information Theory |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2304.12687 |
| رقم الأكسشن: | edsarx.2304.12687 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |