On the capacity of non-coherent network coding

Mahdi Jafari, Soheil Mohajer, Christina Fragouli, Suhas Diggavi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations

Abstract

The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N 2:: 1 receivers can also be achieved using packets of length log N bits, if the operations the intermediate nodes perform are deterministically known at the receivers. We here calculate the capacity in the case where these operations are unknown, and characterize how the capacity depends on the min-cut value and the packet length.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages273-277
Number of pages5
DOIs
StatePublished - 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8102

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
Country/TerritoryKorea, Republic of
CitySeoul
Period6/28/097/3/09

Fingerprint

Dive into the research topics of 'On the capacity of non-coherent network coding'. Together they form a unique fingerprint.

Cite this