Computer Science – Information Theory
Scientific paper
2011-03-18
Computer Science
Information Theory
12 pages, A short version appears in ISIT 2011
Scientific paper
Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, that results in bounds that are tighter than the corresponding cut-set bounds. We also define the concept of "uncertainty region" which might be of independent interest. We provide a full characterization of this region for the case of two correlated random variables. The bounding technique works as follows: on one hand we show that if the communication problem is solvable, the uncertainty of certain random variables in the network with respect to imaginary parties that have partial knowledge of the sources must satisfy some constraints that depend on the network architecture. On the other hand, the same uncertainties have to satisfy constraints that only depend on the joint distribution of the sources. Matching these two leads to restrictions on the statistical joint distribution of the sources in communication problems that are solvable over a given network architecture.
Gohari Amin Aminzadeh
Jaggi Sidharth
Yang Shenghao
No associations
LandOfFree
Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources 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 Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-184802