Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel

Oliver Kosut; Michelle Effros; Michael Langberg

doi:10.1109/ISIT45174.2021.9517769

Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel

Oliver Kosut, Michelle Effros, Michael Langberg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2214-2219
Number of pages	6
ISBN (Electronic)	9781538682098
DOIs	https://doi.org/10.1109/ISIT45174.2021.9517769
State	Published - 12 Jul 2021
Externally published	Yes
Event	2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, Australia Duration: 12 Jul 2021 → 20 Jul 2021

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2021-July
ISSN (Print)	2157-8095

Conference

Conference	2021 IEEE International Symposium on Information Theory, ISIT 2021
Country/Territory	Australia
City	Virtual, Melbourne
Period	12/07/21 → 20/07/21

Bibliographical note

Publisher Copyright:
© 2021 IEEE.

Access to Document

10.1109/ISIT45174.2021.9517769

Cite this

Kosut, O., Effros, M., & Langberg, M. (2021). Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel. In 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings (pp. 2214-2219). (IEEE International Symposium on Information Theory - Proceedings; Vol. 2021-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT45174.2021.9517769

@inproceedings{892ed9c230fe48898a30eeccb285b9c3,

title = "Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel",

abstract = "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.",

author = "Oliver Kosut and Michelle Effros and Michael Langberg",

note = "Publisher Copyright: {\textcopyright} 2021 IEEE.; 2021 IEEE International Symposium on Information Theory, ISIT 2021 ; Conference date: 12-07-2021 Through 20-07-2021",

year = "2021",

month = jul,

day = "12",

doi = "10.1109/ISIT45174.2021.9517769",

language = "אנגלית",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2214--2219",

booktitle = "2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings",

address = "ארצות הברית",

}

Kosut, O, Effros, M & Langberg, M 2021, Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel. in 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings. IEEE International Symposium on Information Theory - Proceedings, vol. 2021-July, Institute of Electrical and Electronics Engineers Inc., pp. 2214-2219, 2021 IEEE International Symposium on Information Theory, ISIT 2021, Virtual, Melbourne, Australia, 12/07/21. https://doi.org/10.1109/ISIT45174.2021.9517769

Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel. / Kosut, Oliver; Effros, Michelle; Langberg, Michael.
2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2021. p. 2214-2219 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2021-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Every Bit Counts

T2 - 2021 IEEE International Symposium on Information Theory, ISIT 2021

AU - Kosut, Oliver

AU - Effros, Michelle

AU - Langberg, Michael

PY - 2021/7/12

Y1 - 2021/7/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85115098999&partnerID=8YFLogxK

U2 - 10.1109/ISIT45174.2021.9517769

DO - 10.1109/ISIT45174.2021.9517769

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85115098999

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2214

EP - 2219

BT - 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 12 July 2021 through 20 July 2021

ER -

Kosut O, Effros M, Langberg M. Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel. In 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2021. p. 2214-2219. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT45174.2021.9517769

Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this