The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.)
- 1 May 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 29 (3) , 441-445
- https://doi.org/10.1109/tit.1983.1056660
Abstract
We introduce the communication situation in which the encoders of a multiple access channel are partially cooperating. These encoders are connected by communication links with finite capacities, which permit both encoders to communicate with each other. First we give a general definition of such a communication process (conference). Then, by proving a converse and giving an achievability proof, we establish the capacity region of the multiple access channel with partially cooperating encoders. It turns out that the optimal conference is very simple.Keywords
This publication has 3 references indexed in Scilit:
- Source coding with side information and a converse for degraded broadcast channelsIEEE Transactions on Information Theory, 1975
- The Capacity Region of a Channel with Two Senders and Two ReceiversThe Annals of Probability, 1974
- A Coding Theorem for Multiple Access Channels With Correlated SourcesBell System Technical Journal, 1973