A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Graph Entropy Characterization of Relay-Assisted Zero-Error Source Coding with Side Information
2011
2011 Data Compression Conference
Preserved Fulltext
A sender knows X and a receiver knows a correlated Z and would like to learn X, without error. The sender can communicate with the receiver only via a relay, that knows a correlated Y . We study the expected number of bits per instance that need to be sent to and from the relay to that end, in the limit of multiple instances.
doi:10.1109/dcc.2011.31
dblp:conf/dcc/Shayevitz11
fatcat:4bu363l7z5b5rfe4qpynx2ge2u