On function computation over a cascade network

Milad Sefidgaran; Aslan Tchamkerten

doi:10.1109/ITW.2012.6404718

On function computation over a cascade network

Milad Sefidgaran
, Aslan Tchamkerten

Telecom Paris

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

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.

langue originale	Anglais
titre	2012 IEEE Information Theory Workshop, ITW 2012
Pages	472-476
Nombre de pages	5
Les DOIs	https://doi.org/10.1109/ITW.2012.6404718
état	Publié - 1 déc. 2012
Evénement	2012 IEEE Information Theory Workshop, ITW 2012 - Lausanne, Suisse Durée: 3 sept. 2012 → 7 sept. 2012

Série de publications

Nom	2012 IEEE Information Theory Workshop, ITW 2012

Une conférence

Une conférence	2012 IEEE Information Theory Workshop, ITW 2012
Pays/Territoire	Suisse
La ville	Lausanne
période	3/09/12 → 7/09/12

Accès au document

10.1109/ITW.2012.6404718

Contient cette citation

@inproceedings{2012d3a894e142fe8a11ec91f9df06ce,

title = "On function computation over a cascade network",

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.",

author = "Milad Sefidgaran and Aslan Tchamkerten",

year = "2012",

month = dec,

day = "1",

doi = "10.1109/ITW.2012.6404718",

language = "English",

isbn = "9781467302234",

series = "2012 IEEE Information Theory Workshop, ITW 2012",

pages = "472--476",

booktitle = "2012 IEEE Information Theory Workshop, ITW 2012",

note = "2012 IEEE Information Theory Workshop, ITW 2012 ; Conference date: 03-09-2012 Through 07-09-2012",

}

TY - GEN

T1 - On function computation over a cascade network

AU - Sefidgaran, Milad

AU - Tchamkerten, Aslan

PY - 2012/12/1

Y1 - 2012/12/1

N2 - 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.

AB - 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.

U2 - 10.1109/ITW.2012.6404718

DO - 10.1109/ITW.2012.6404718

M3 - Conference contribution

AN - SCOPUS:84873184254

SN - 9781467302234

T3 - 2012 IEEE Information Theory Workshop, ITW 2012

SP - 472

EP - 476

BT - 2012 IEEE Information Theory Workshop, ITW 2012

T2 - 2012 IEEE Information Theory Workshop, ITW 2012

Y2 - 3 September 2012 through 7 September 2012

ER -

On function computation over a cascade network

Résumé

Série de publications

Une conférence

Accès au document

Empreinte digitale

Contient cette citation