On Function Computation over a Cascade Network (Invited Paper) - Télécom Paris
Communication Dans Un Congrès Année : 2012

On Function Computation over a Cascade Network (Invited Paper)

Résumé

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.
Fichier non déposé

Dates et versions

hal-02288337 , version 1 (14-09-2019)

Identifiants

  • HAL Id : hal-02288337 , version 1

Citer

Milad Sefidgaran, Aslan Tchamkerten. On Function Computation over a Cascade Network (Invited Paper). IEEE Information Theory Workshop, Sep 2012, Lausanne, Switzerland. ⟨hal-02288337⟩
30 Consultations
0 Téléchargements

Partager

More