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 -