On Function Computation over a Cascade Network (Invited Paper)

Milad Sefidgaran A. Tchamkerten 1, 2
1 COMNUM - Communications Numériques
LTCI - Laboratoire Traitement et Communication de l'Information
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 f(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 f(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.

Document type :
Conference papers
Complete list of metadatas

Contributor : Telecomparis Hal <>
Submitted on : Saturday, September 14, 2019 - 6:42:08 PM
Last modification on : Sunday, September 15, 2019 - 1:22:31 AM


  • HAL Id : hal-02288337, version 1


Milad Sefidgaran, A. Tchamkerten. On Function Computation over a Cascade Network (Invited Paper). IEEE Information Theory Workshop, Sep 2012, Lausanne, Switzerland. ⟨hal-02288337⟩



Record views