Linear capacity equivalence between multiple multicast and multiple unicast

M. F. Wong; M. Langberg; M. Effros

doi:10.1109/ISIT.2014.6875214

Linear capacity equivalence between multiple multicast and multiple unicast

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

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

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 language	English
Title of host publication	2014 IEEE International Symposium on Information Theory, ISIT 2014
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2152-2156
Number of pages	5
ISBN (Print)	9781479951864
DOIs	https://doi.org/10.1109/ISIT.2014.6875214
State	Published - 2014
Externally published	Yes
Event	2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States Duration: 29 Jun 2014 → 4 Jul 2014

Publication series

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

Conference

Conference	2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/Territory	United States
City	Honolulu, HI
Period	29/06/14 → 4/07/14

Access to Document

10.1109/ISIT.2014.6875214

Cite this

Wong, M. F., Langberg, M., & Effros, M. (2014). Linear capacity equivalence between multiple multicast and multiple unicast. In 2014 IEEE International Symposium on Information Theory, ISIT 2014 (pp. 2152-2156). Article 6875214 (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2014.6875214

@inproceedings{46f5f1682d9b41e19ac1ff88f4bddd8f,

title = "Linear capacity equivalence between multiple multicast and multiple unicast",

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

author = "Wong, {M. F.} and M. Langberg and M. Effros",

year = "2014",

doi = "10.1109/ISIT.2014.6875214",

language = "אנגלית",

isbn = "9781479951864",

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

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

pages = "2152--2156",

booktitle = "2014 IEEE International Symposium on Information Theory, ISIT 2014",

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

}

Wong, MF, Langberg, M & Effros, M 2014, Linear capacity equivalence between multiple multicast and multiple unicast. in 2014 IEEE International Symposium on Information Theory, ISIT 2014., 6875214, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 2152-2156, 2014 IEEE International Symposium on Information Theory, ISIT 2014, Honolulu, HI, United States, 29/06/14. https://doi.org/10.1109/ISIT.2014.6875214

Linear capacity equivalence between multiple multicast and multiple unicast. / Wong, M. F.; Langberg, M.; Effros, M.
2014 IEEE International Symposium on Information Theory, ISIT 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 2152-2156 6875214 (IEEE International Symposium on Information Theory - Proceedings).

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

TY - GEN

T1 - Linear capacity equivalence between multiple multicast and multiple unicast

AU - Wong, M. F.

AU - Langberg, M.

AU - Effros, M.

PY - 2014

Y1 - 2014

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

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

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

U2 - 10.1109/ISIT.2014.6875214

DO - 10.1109/ISIT.2014.6875214

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

AN - SCOPUS:84906542546

SN - 9781479951864

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2152

EP - 2156

BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 29 June 2014 through 4 July 2014

ER -

Linear capacity equivalence between multiple multicast and multiple unicast

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this