2000 character limit reached
The State-Dependent Channel with a Rate-Limited Cribbing Helper
Published 23 Jan 2024 in cs.IT and math.IT | (2401.12763v1)
Abstract: The capacity of a memoryless state-dependent channel is derived for a setting in which the encoder is provided with rate-limited assistance from a cribbing helper that observes the state sequence causally and the past channel inputs strictly-causally. Said cribbing may increase capacity but not to the level achievable by a message-cognizant helper.
- C. E. Shannon, “Channels with side information at the transmitter,” IBM J. Res. Dev., vol. 2, pp. 289–293, Oct 1958.
- S. I. Gel’fand and M. S. Pinsker, “Coding for channel with random parameters,” Problems of Control Inform. Theory, vol. 9, pp. 19–31, Jan 1980.
- A. Lapidoth and L. Wang, “State-dependent DMC with a causal helper,” IEEE Transactions on Information Theory, 2024. To appear.
- F. M. J. Willems and E. van der Meulen, “The discrete memoryless multiple-access channel with cribbing encoders,” IEEE Transactions on Information Theory, vol. 31, pp. 313–327, May 1985.
- H. Asnani and H. H. Permuter, “Multiple-access channel with partial and controlled cribbing encoders,” IEEE Transactions on Information Theory, vol. 59, pp. 2252–2266, April 2013.
- A. Lapidoth, L. Wang, and Y. Yan, “State-dependent channels with a message-cognizant helper,” 2023, arXiv:2311.08220 [cs.IT].
- A. Lapidoth, L. Wang, and Y. Yan, “Message-cognizant assistance and feedback for the Gaussian channel,” 2023, arXiv:2310.15768 [cs.IT].
- I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. London, U.K.: Cambridge University Press, 2 ed., 2011.
- A. El Gamal and Y. Kim, Network Information Theory. Cambridge, U.K.: Cambridge University Press, 2011.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.