On feedback, cribbing, and causal state-information on the multiple-access channel

We show that the capacity region of the state-dependent multiple-access channel (SD-MAC) with strictly-causally cribbing encoders is not enlarged if strictly-causal state-information (SI) and feedback are furnished to the encoders. We also derive the capacity region of the SD-MAC with causal SI at the cribbing encoders and show that Shannon strategies are optimal. Such strategies are generally suboptimal if the encoders access distinct SI. However, Shannon strategies are optimal and we have a characterization of the capacity region for the case where both encoders crib, causal SI is revealed to one encoder, and feedback is available to the other encoder.

[1]  Jack K. Wolf,et al.  The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[2]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[3]  Frans M. J. Willems,et al.  The discrete memoryless multiple-access channel with cribbing encoders , 1985, IEEE Trans. Inf. Theory.

[4]  Amos Lapidoth,et al.  The Multiple-Access Channel With Causal Side Information: Double State , 2013, IEEE Transactions on Information Theory.

[5]  Sennur Ulukus,et al.  Outer Bounds for Multiple-Access Channels With Feedback Using Dependence Balance , 2009, IEEE Transactions on Information Theory.

[6]  Amos Lapidoth,et al.  The Multiple-Access Channel With Causal Side Information: Common State , 2013, IEEE Transactions on Information Theory.

[7]  Neri Merhav,et al.  Channel Coding in the Presence of Side Information , 2008, Found. Trends Commun. Inf. Theory.

[8]  Frans M. J. Willems The feedback capacity region of a class of discrete memoryless multiple access channels , 1982, IEEE Trans. Inf. Theory.

[9]  Frans M. J. Willems,et al.  The discrete memoryless multiple access channel with partially cooperating encoders , 1983, IEEE Trans. Inf. Theory.

[10]  Amos Lapidoth,et al.  The multiple access channel with two independent states each known causally to one encoder , 2010, 2010 IEEE International Symposium on Information Theory.

[11]  Haim Permuter,et al.  Multiple-Access Channel With Partial and Controlled Cribbing Encoders , 2013, IEEE Transactions on Information Theory.

[12]  Edward C. van der Meulen,et al.  Partial feedback for the discrete memoryless multiple access channel , 1983, IEEE Trans. Inf. Theory.

[13]  Cyril Leung,et al.  An achievable rate region for the multiple-access channel with feedback , 1981, IEEE Trans. Inf. Theory.

[14]  D. Slepian,et al.  A coding theorem for multiple access channels with correlated sources , 1973 .

[15]  Andries P. Hekstra,et al.  Dependence balance bounds for single-output two-way channels , 1989, IEEE Trans. Inf. Theory.

[16]  Claude E. Shannon,et al.  Channels with Side Information at the Transmitter , 1958, IBM J. Res. Dev..

[17]  F. Willems On multiple access channels with feedback , 1984, IEEE Trans. Inf. Theory.

[18]  Amos Lapidoth,et al.  The state-dependent multiple-access channel with states available at a cribbing encoder , 2010, 2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel.

[19]  Abbas El Gamal,et al.  The feedback capacity of degraded broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[20]  Shlomo Shamai,et al.  Cooperative Multiple-Access Encoding With States Available at One Transmitter , 2008, IEEE Transactions on Information Theory.