TY - GEN
T1 - On the capacity of non-coherent network coding
AU - Jafari, Mahdi
AU - Mohajer, Soheil
AU - Fragouli, Christina
AU - Diggavi, Suhas
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=70449460959&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449460959&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2009.5205851
DO - 10.1109/ISIT.2009.5205851
M3 - Conference contribution
AN - SCOPUS:70449460959
SN - 9781424443130
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 273
EP - 277
BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009
T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009
Y2 - 28 June 2009 through 3 July 2009
ER -