Skip to main navigation Skip to search Skip to main content

Linear capacity equivalence between multiple multicast and multiple unicast

  • California Institute of Technology

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

2 Scopus citations

Abstract

An equivalence between multiple multicast and multiple unicast network codes is proven in a 2007 paper by Dougherty and Zeger. A related equivalence between multiple multicast and multiple unicast capacity for general (possibly noisy) memoryless networks is proven in a 2013 paper by the current authors. While the construction used in the proof from the earlier paper maps any linear code for one network to a linear code for the other network, the construction from the later paper does not necessarily preserve linearity. As a result, the 2013 result does not prove an equivalence between the capacity achievable by linear codes in memoryless multiple multicast and memoryless multiple unicast networks. The linear capacity equivalence for memoryless multiple multicast and multiple unicast networks is proven in this work.

Original languageEnglish
Title of host publication2014 IEEE International Symposium on Information Theory, ISIT 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2152-2156
Number of pages5
ISBN (Print)9781479951864
DOIs
StatePublished - 2014
Event2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States
Duration: Jun 29 2014Jul 4 2014

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Conference

Conference2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/TerritoryUnited States
CityHonolulu, HI
Period06/29/1407/4/14

Fingerprint

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

Cite this