Dualities Between Entropy Functions and Network Codes

Details Dualities Between Entropy Functions and Network Codes Dualities Between Entropy Functions and Network Codes

2007-08-31

arxiv.org/abs/0708.4328v1

Computer Science

Information Theory

Scientific paper

This paper provides a new duality between entropy functions and network codes. Given a function $g\geq 0$ defined on all proper subsets of $N$ random variables, we provide a construction for a network multicast problem which is solvable if and only if $g$ is entropic. The underlying network topology is fixed and the multicast problem depends on $g$ only through edge capacities and source rates. Relaxing the requirement that the domain of $g$ be subsets of random variables, we obtain a similar duality between polymatroids and the linear programming bound. These duality results provide an alternative proof of the insufficiency of linear (and abelian) network codes, and demonstrate the utility of non-Shannon inequalities to tighten outer bounds on network coding capacity regions.

Affiliated with

Also associated with

No associations

Rating

Dualities Between Entropy Functions and Network Codes 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 Dualities Between Entropy Functions and Network Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dualities Between Entropy Functions and Network Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-618202