The work at hand presents a finite-blocklength analysis of the multiple access channel (MAC) sum-rate under the cooperation facilitator (CF) model. The CF model, in which independent encoders coordinate through an intermediary node, is known to show significant rate benefits, even when the rate of cooperation is limited. We continue this line of study for cooperation rates which are sub-linear in the blocklength n. Roughly speaking, our results show that if the facilitator transmits log K bits, then there is a sum-rate benefit of order √log K/n compared to the best-known achievable rate. This result extends across a wide range of K: even a single bit of cooperation is shown to provide a sum-rate benefit of order 1/√n.
|Title of host publication||2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||6|
|State||Published - 12 Jul 2021|
|Event||2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, Australia|
Duration: 12 Jul 2021 → 20 Jul 2021
|Name||IEEE International Symposium on Information Theory - Proceedings|
|Conference||2021 IEEE International Symposium on Information Theory, ISIT 2021|
|Period||12/07/21 → 20/07/21|
Bibliographical noteFunding Information:
O. Kosut is with the School of Electrical, Computer and Energy Engineering at Arizona State University. Email: firstname.lastname@example.org M. Effros is with the Department of Electrical Engineering at the California Institute of Technology. Email: email@example.com M. Langberg is with the Department of Electrical Engineering at the University at Buffalo (State University of New York). Email: firstname.lastname@example.org This work is supported in part by NSF grants CCF-1817241, CCF-1908725, and CCF-1909451. The full version of this work appears in .
© 2021 IEEE.