TY - JOUR
T1 - The discrete memoryless multiple-access channel with cribbing encoders
AU - Willems, Frans M.J.
AU - van der Meulen, Edward C.
PY - 1985/1/1
Y1 - 1985/1/1
N2 - The capacity regions are determined for various communication situations in which one or both encoders for a multiple access channel crib from the other encoder and learn the channel input(s) (to be) emitted by this encoder. Most of the achievability proofs in this paper hinge upon the new concept of backward decoding. Also, the notion of Shannon strategies seems to be of crucial importance. It is demonstrated that in some situations parts of the total cooperation line are achievable. Moreover, it is proved that if the encoders and the decoder are allowed to be nondeterministic, the capacity regions are not increased.
AB - The capacity regions are determined for various communication situations in which one or both encoders for a multiple access channel crib from the other encoder and learn the channel input(s) (to be) emitted by this encoder. Most of the achievability proofs in this paper hinge upon the new concept of backward decoding. Also, the notion of Shannon strategies seems to be of crucial importance. It is demonstrated that in some situations parts of the total cooperation line are achievable. Moreover, it is proved that if the encoders and the decoder are allowed to be nondeterministic, the capacity regions are not increased.
UR - https://www.scopus.com/pages/publications/0022054657
U2 - 10.1109/TIT.1985.1057042
DO - 10.1109/TIT.1985.1057042
M3 - Article
AN - SCOPUS:0022054657
SN - 0018-9448
VL - 31
SP - 313
EP - 327
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 3
ER -