Network Coding Capacity: A Functional Dependence Bound

Details Network Coding Capacity: A Functional Dependence Bound Network Coding Capacity: A Functional Dependence Bound

2009-01-29

arxiv.org/abs/0901.4612v1

Computer Science

Information Theory

5 pages, 2 figures, submitted to the International Symposium on Information Theory 2009

Scientific paper

Explicit characterization and computation of the multi-source network coding capacity region (or even bounds) is long standing open problem. In fact, finding the capacity region requires determination of the set of all entropic vectors $\Gamma^{*}$, which is known to be an extremely hard problem. On the other hand, calculating the explicitly known linear programming bound is very hard in practice due to an exponential growth in complexity as a function of network size. We give a new, easily computable outer bound, based on characterization of all functional dependencies in networks. We also show that the proposed bound is tighter than some known bounds.

Affiliated with

Also associated with

No associations

Rating

Network Coding Capacity: A Functional Dependence Bound 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 Network Coding Capacity: A Functional Dependence Bound, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network Coding Capacity: A Functional Dependence Bound will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-13210