CaltechAUTHORS
  A Caltech Library Service

Can Negligible Rate Increase Network Reliability?

Noorzad, Parham and Effros, Michelle and Langberg, Michael (2018) Can Negligible Rate Increase Network Reliability? IEEE Transactions on Information Theory, 64 (6). pp. 4282-4293. ISSN 0018-9448. http://resolver.caltech.edu/CaltechAUTHORS:20170614-160818881

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20170614-160818881

Abstract

In network cooperation strategies, nodes work together with the aim of increasing transmission rates or reliability. This paper demonstrates that enabling cooperation between the transmitters of a two-user multiple access channel via a cooperation facilitator that has access to both messages results in a network whose maximal- and average-error capacity regions are the same; this benefit ensues even when the information received by each transmitter is negligible. From this result, it follows that if a multiple access channel with no transmitter cooperation has different maximal- and average-error sumcapacities, then the maximal-error sum-capacity of the network consisting of this channel and a cooperation facilitator is not continuous with respect to the output edge capacities of the facilitator. Thus there exist networks where adding negligible rate yields a non-negligible benefit.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/TIT.2017.2713801DOIArticle
http://ieeexplore.ieee.org/document/7944667/PublisherArticle
Additional Information:© 2017 IEEE. Manuscript received September 30, 2016; revised May 15, 2017; accepted May 20, 2017. Date of publication June 8, 2017; date of current version May 18, 2018. This material is based upon work supported by the National Science Foundation under Grant 1527524, Grant 1526771, and Grant 1321129. This paper was presented in part at the 2016 IEEE International Symposium on Information Theory [1].
Funders:
Funding AgencyGrant Number
NSFCCF-1527524
NSFCCF-1526771
NSFCCF-1321129
Subject Keywords:Continuity, cooperation, edge removal, maximal-error capacity region, multiple access channel, negligible capacity, network information theory, reliability
Record Number:CaltechAUTHORS:20170614-160818881
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20170614-160818881
Official Citation:P. Noorzad, M. Effros and M. Langberg, "Can Negligible Rate Increase Network Reliability?," in IEEE Transactions on Information Theory, vol. 64, no. 6, pp. 4282-4293, June 2018. doi: 10.1109/TIT.2017.2713801
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:78220
Collection:CaltechAUTHORS
Deposited By: Kristin Buxton
Deposited On:14 Jun 2017 23:18
Last Modified:23 May 2018 15:07

Repository Staff Only: item control page