DocumentCode
2857150
Title
On function computation over a cascade network
Author
Sefidgaran, Milad ; Tchamkerten, Aslan
Author_Institution
Dept. of Commun. & Electron, Telecom ParisTech, Paris, France
fYear
2012
fDate
3-7 Sept. 2012
Firstpage
472
Lastpage
476
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.
Keywords
Markov processes; cascade networks; functions; relays; Markov chain; cascade network; function computation; receiver; relay; transmitter; Conferences; Information theory; Markov processes; Random variables; Receivers; Relays; Transmitters;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop (ITW), 2012 IEEE
Conference_Location
Lausanne
Print_ISBN
978-1-4673-0224-1
Electronic_ISBN
978-1-4673-0222-7
Type
conf
DOI
10.1109/ITW.2012.6404718
Filename
6404718
Link To Document