Referenced Items are not available for this document.
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.
Published in:
Data Compression Conference (DCC), 2011
Date of Conference: 29-31 March 2011
- Page(s):
- 243 - 252
- ISSN :
- 1068-0314
- Print ISBN:
- 978-1-61284-279-0
- INSPEC Accession Number:
- 11933094
- Conference Location :
- Snowbird, UT
- Digital Object Identifier :
- 10.1109/DCC.2011.31
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
