Journal of Global Optimization
Convex Optimization
Coding for Errors and Erasures in Random Network Coding
IEEE Transactions on Information Theory
Code construction for multiple sources network coding
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
Compressed network coding vectors
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Secret Error Control Codes Against Malicious Attacks in Random Multisource Network Coding
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
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.