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
ConverseEncoderComputer scienceChannel (broadcasting)Simple (philosophy)Channel capacityComputer networkProcess (computing)Theoretical computer scienceAlgorithmMathematicsProgramming language
Affiliated Institutions
Related Publications
The discrete memoryless multiple-access channel with cribbing encoders
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 ch...
The Wire-Tap Channel
We consider the situation in which digital data is to be reliably transmitted over a discrete, memoryless channel (dmc) that is subjected to a wire-tap at the receiver. We assum...
Distributed source coding for satellite communications
Inspired by mobile satellite communications systems, we consider a source coding system which consists of multiple sources, multiple encoders, and multiple decoders. Each encode...
MIMO Capacity Through Correlated Channels in the Presence of Correlated Interferers and Noise: A (Not So) Large N Analysis
The use of multiple-antenna arrays in both transmission and reception promises huge increases in the throughput of wireless communication systems. It is therefore important to a...
Achievability proof of some multiuser channel coding theorems using backward decoding
New and simpler achievability proofs that are based on the backward decoding technique are presented for the well-known coding theorems for the multiple-access channel (MAC) wit...
Publication Info
- Year
- 1983
- Type
- article
- Volume
- 29
- Issue
- 3
- Pages
- 441-445
- Citations
- 252
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
252
OpenAlex
Cite This
Frank Willems
(1983).
The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.).
IEEE Transactions on Information Theory
, 29
(3)
, 441-445.
https://doi.org/10.1109/tit.1983.1056660
Identifiers
- DOI
- 10.1109/tit.1983.1056660