Abstract

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.

Keywords

EncoderNondeterministic algorithmDecoding methodsChannel capacityComputer scienceChannel (broadcasting)Mathematical proofAlgorithmChannel codeTheoretical computer scienceMathematicsTelecommunications

Affiliated Institutions

Related Publications

Publication Info

Year
1985
Type
article
Volume
31
Issue
3
Pages
313-327
Citations
236
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

236
OpenAlex

Cite This

F.M.J. Willems, E. van der Meulen (1985). The discrete memoryless multiple-access channel with cribbing encoders. IEEE Transactions on Information Theory , 31 (3) , 313-327. https://doi.org/10.1109/tit.1985.1057042

Identifiers

DOI
10.1109/tit.1985.1057042