Proceedings Article10.1109/ITW.2012.6404718
On function computation over a cascade network
Milad Sefidgaran,Aslan Tchamkerten +1 more
- 01 Sep 2012
- pp 472-476
TL;DR: The main result is an inner bound to the rate region of this problem which is tight when X - Y - Z forms a Markov chain.
read more
Abstract: A transmitter has access to X, a relay has access to Y, and a receiver has access to Z and wants to compute a given function ƒ(X, Y, Z). How many bits must be transmitted from the transmitter to the relay and from the relay to the receiver so that the latter can reliably recover ƒ(X, Y, Z)? The main result is an inner bound to the rate region of this problem which is tight when X - Y - Z forms a Markov chain.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
On Cooperation in Multi-Terminal Computation and Rate Distortion
TL;DR: A general inner bound to the above three dimensional rate region is provided and shown to be tight in a number of interesting settings: the function is partially invertible, full cooperation, one-round point-to-point communication, two-round pointed communication, and cascade.
14
On cooperation in multi-terminal computation and rate distortion
Milad Sefidgaran,Aslan Tchamkerten +1 more
- 01 Jul 2012
TL;DR: In this article, a general inner bound to the above three dimensional rate region is provided and shown to be tight in a number of interesting settings: the function is partially invertible, full cooperation, one-round point-to-point communication, two-round and cascade.
12
Distributed function computation over a tree network
Milad Sefidgaran,Aslan Tchamkerten +1 more
- 23 Dec 2013
TL;DR: This paper investigates a distributed function computation setting where the underlying network is a rooted directed tree and the root wants to compute a function of the sources of information available at the nodes of the network.
8
Sequential functional quantization
Vinith Misra,Krishnamurthy Viswanathan +1 more
- 07 Jul 2013
TL;DR: In this article, the authors consider the problem of companding quantization under non-difference distortion measures, and derive the optimal distortion-rate exponent for quantization with sensitivity matrices.
6
Rate-distortion regions of instances of cascade source coding with side information
Chien-Yi Wang,Abdellatif Zaidi +1 more
- 01 Jun 2017
TL;DR: This work studies a three-terminal cascade source coding problem with side information Yi known to the source encoder and the first user, and side information Y2 known only to the second user, to infer single-letter characterization of the rate-distortion region of this model.
1
References
Coding for computing
Alon Orlitsky,J.R. Roche +1 more
- 17 Sep 1995
TL;DR: It is shown that if only the sender can transmit, the number of bits required is a conditional entropy of a naturally defined graph.
536
Coding for computing
Alon Orlitsky,J.R. Roche +1 more
- 23 Oct 1995
TL;DR: It is shown that if only the sender can transmit, the number of bits required is a conditional entropy of a naturally defined graph.
283
•Posted Content
On Cooperation in Multi-Terminal Computation and Rate Distortion
TL;DR: A general inner bound to the above three dimensional rate region is provided and shown to be tight in a number of interesting settings: the function is partially invertible, full cooperation, one-round point-to-point communication, two-round pointed communication, and cascade.
14
A relay-assisted distributed source coding problem
Prakash Ishwar,S. Sandeep Pradhan +1 more
- 15 Aug 2008
TL;DR: A relay-assisted distributed source coding problem with three statistically correlated sources is formulated and studied and a single unified coding strategy which subsumes all four special classes is derived.
On the memory required to compute functions of streaming data
Krishnamurthy Viswanathan
- 13 Jun 2010
TL;DR: A correspondence between the problem of computing functions of data streams while employing limited memory in a standard information-theoretic framework and a functional source coding problem in cascade/line networks is established.
12