Computer Science – Information Theory
Scientific paper
2009-01-15
Computer Science
Information Theory
9 pages. A 5-page version without appendices was submitted to IEEE International Symposium on Information Theory (ISIT), 2009.
Scientific paper
We study the limits of communication efficiency for function computation in collocated networks within the framework of multi-terminal block source coding theory. With the goal of computing a desired function of sources at a sink, nodes interact with each other through a sequence of error-free, network-wide broadcasts of finite-rate messages. For any function of independent sources, we derive a computable characterization of the set of all feasible message coding rates - the rate region - in terms of single-letter information measures. We show that when computing symmetric functions of binary sources, the sink will inevitably learn certain additional information which is not demanded in computing the function. This conceptual understanding leads to new improved bounds for the minimum sum-rate. The new bounds are shown to be orderwise better than those based on cut-sets as the network scales. The scaling law of the minimum sum-rate is explored for different classes of symmetric functions and source parameters.
Gupta Piyush
Ishwar Prakash
Ma N. N.
No associations
LandOfFree
Information-Theoretic Bounds for Multiround Function Computation in Collocated Networks 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 Information-Theoretic Bounds for Multiround Function Computation in Collocated Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information-Theoretic Bounds for Multiround Function Computation in Collocated Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-126785