CaltechAUTHORS
  A Caltech Library Service

Negligible Cooperation: Contrasting the Maximaland Average-Error Cases

Noorzad, Parham and Langberg, Michael and Effros, Michelle (2021) Negligible Cooperation: Contrasting the Maximaland Average-Error Cases. IEEE Transactions on Information Theory, 67 (9). pp. 5885-5902. ISSN 0018-9448. doi:10.1109/tit.2021.3093891. https://resolver.caltech.edu/CaltechAUTHORS:20210729-170824093

[img] PDF - Accepted Version
See Usage Policy.

1MB

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20210729-170824093

Abstract

In communication networks, cooperative strategies are coding schemes where network nodes work together to improve performance metrics such as the total rate delivered across the network. This work studies encoder cooperation in the setting of a discrete multiple access channel (MAC) with two encoders and a single decoder. A network node, here called the cooperation facilitator (CF), that is connected to both encoders via rate-limited links, enables the cooperation strategy. Previous work by the authors presents two classes of MACs: (i) one class where the average-error sum-capacity has an infinite derivative in the limit where CF output link capacities approach zero, and (ii) a second class of MACs where the maximal-error sum-capacity is not continuous at the point where the output link capacities of the CF equal zero. This work contrasts the power of the CF in the maximal- and average-error cases, showing that a constant number of bits communicated over the CF output link can yield a positive gain in the maximal-error sum-capacity, while a far greater number of bits, even a number that grows sublinearly in the blocklength, can never yield a non-negligible gain in the average-error sum-capacity.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/tit.2021.3093891DOIArticle
ORCID:
AuthorORCID
Noorzad, Parham0000-0002-0201-3791
Langberg, Michael0000-0002-7470-0718
Effros, Michelle0000-0003-3757-0675
Additional Information:© 2021 IEEE. Manuscript received November 23, 2019; revised June 5, 2021; accepted June 16, 2021. Date of publication July 1, 2021; date of current version August 25, 2021. This work was supported by the National Science Foundation under Grant 1527524 and Grant 1526771. This article was presented in part at the 2016 IEEE Globecom Workshops and the 2018 IEEE International Symposium Information Theory.
Funders:
Funding AgencyGrant Number
NSFCCF-1527524
NSFCCF-1526771
Subject Keywords:Capacity region continuity, cooperation facilitator, edge removal problem, maximal-error capacity region, multiple access channel
Issue or Number:9
DOI:10.1109/tit.2021.3093891
Record Number:CaltechAUTHORS:20210729-170824093
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20210729-170824093
Official Citation:P. Noorzad, M. Langberg and M. Effros, "Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases," in IEEE Transactions on Information Theory, vol. 67, no. 9, pp. 5885-5902, Sept. 2021, doi: 10.1109/TIT.2021.3093891
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:110067
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:02 Aug 2021 18:53
Last Modified:02 Sep 2021 17:17

Repository Staff Only: item control page