Mission impossible: Computing the network coding capacity region

Details Mission impossible: Computing the network coding capacity region Mission impossible: Computing the network coding capacity region

2008-01-31

arxiv.org/abs/0802.0030v1

Computer Science

Information Theory

Scientific paper

One of the main theoretical motivations for the emerging area of network coding is the achievability of the max-flow/min-cut rate for single source multicast. This can exceed the rate achievable with routing alone, and is achievable with linear network codes. The multi-source problem is more complicated. Computation of its capacity region is equivalent to determination of the set of all entropy functions $\Gamma^*$, which is non-polyhedral. The aim of this paper is to demonstrate that this difficulty can arise even in single source problems. In particular, for single source networks with hierarchical sink requirements, and for single source networks with secrecy constraints. In both cases, we exhibit networks whose capacity regions involve $\Gamma^*$. As in the multi-source case, linear codes are insufficient.

Affiliated with

Also associated with

No associations

Rating

Mission impossible: Computing the network coding capacity region does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Mission impossible: Computing the network coding capacity region, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mission impossible: Computing the network coding capacity region will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-37423