On the Capacity of Non-Coherent Network Coding

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


Published in:
2009 Ieee International Symposium On Information Theory, Vols 1- 4, 273-277
Presented at:
IEEE International Symposium on Information Theory (ISIT 2009), Seoul, SOUTH KOREA, Jun 28-Jul 03, 2009
Year:
2009
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
Laboratories:




 Record created 2010-11-30, last modified 2018-03-18

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)