2015/04/17 by Parham Noorzad, Noorzad, Parham, Michelle Effros +3 · 1 citation
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1504.04432
15 pages, 3 figures. To be presented at ISIT 2015
arxiv created 2015/04/17 · arxiv updated 2015/04/20
In a cooperative coding scheme, network nodes work together to achieve higher transmission rates. To obtain a better understanding of cooperation, we consider a model in which two transmitters send rate-limited descriptions of their messages to a "cooperation facilitator", a node that sends back rate-limited descriptions of the pair to each transmitter. This model includes the conferencing encoders model and a prior model from the current authors as special cases. We show that except for a special class of multiple access channels, the gain in sum-capacity resulting from cooperation under this model is quite large. Adding a cooperation facilitator to any such channel results in a network that does not satisfy the edge removal property. An important special case is the Gaussian multiple access channel, for which we explicitly characterize the sum-rate cooperation gain.