On a capacity equivalence between multiple multicast and multiple unicast

M. F. Wong, M. Langberg, M. Effros

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

An equivalence between multiple multicast and multiple unicast network coding is proven in a 2007 paper by Dougherty and Zeger. The result is extended to index coding under the assumption of linear coding in recent work by Maleki et al. In this work, we extend the result to arbitrary (e.g. possibly noisy) memoryless networks under an asymptotic definition of reliability. We show the equivalence for non-linear index codes as a special case. Our result implies that solving the multiple unicast communication problem is sufficient to solve all communication problems in memoryless networks.

Original languageEnglish
Title of host publication2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
PublisherIEEE Computer Society
Pages1537-1544
Number of pages8
ISBN (Print)9781479934096
DOIs
StatePublished - 2013
Externally publishedYes
Event51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013 - Monticello, IL, United States
Duration: 2 Oct 20134 Oct 2013

Publication series

Name2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013

Conference

Conference51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
Country/TerritoryUnited States
CityMonticello, IL
Period2/10/134/10/13

Fingerprint

Dive into the research topics of 'On a capacity equivalence between multiple multicast and multiple unicast'. Together they form a unique fingerprint.

Cite this