Graph entropy characterization of relay-assisted zero-error source coding with side information

Ofer Shayevitz

doi:https://doi.org/10.1109/DCC.2011.31

Graph entropy characterization of relay-assisted zero-error source coding with side information

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	Proceedings - DCC 2011
Subtitle of host publication	2011 Data Compression Conference
Pages	243-252
Number of pages	10
DOIs	https://doi.org/10.1109/DCC.2011.31
State	Published - 2011
Externally published	Yes
Event	2011 Data Compression Conference, DCC 2011 - Snowbird, UT, United States Duration: 29 Mar 2011 → 31 Mar 2011

Publication series

Name	Data Compression Conference Proceedings

Conference

Conference	2011 Data Compression Conference, DCC 2011
Country/Territory	United States
City	Snowbird, UT
Period	29/03/11 → 31/03/11

All Science Journal Classification (ASJC) codes

Computer Networks and Communications

Access to Document

https://doi.org/10.1109/DCC.2011.31

Cite this

@inproceedings{3a0587dc2dec43a3b34da3abddfa0b7a,

title = "Graph entropy characterization of relay-assisted zero-error source coding with side information",

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

author = "Ofer Shayevitz",

year = "2011",

doi = "https://doi.org/10.1109/DCC.2011.31",

language = "الإنجليزيّة",

isbn = "9780769543529",

series = "Data Compression Conference Proceedings",

pages = "243--252",

booktitle = "Proceedings - DCC 2011",

note = "2011 Data Compression Conference, DCC 2011 ; Conference date: 29-03-2011 Through 31-03-2011",

}

TY - GEN

T1 - Graph entropy characterization of relay-assisted zero-error source coding with side information

AU - Shayevitz, Ofer

PY - 2011

Y1 - 2011

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

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

UR - http://www.scopus.com/inward/record.url?scp=79955741341&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/DCC.2011.31

DO - https://doi.org/10.1109/DCC.2011.31

M3 - منشور من مؤتمر

SN - 9780769543529

T3 - Data Compression Conference Proceedings

SP - 243

EP - 252

BT - Proceedings - DCC 2011

T2 - 2011 Data Compression Conference, DCC 2011

Y2 - 29 March 2011 through 31 March 2011

ER -

Graph entropy characterization of relay-assisted zero-error source coding with side information

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this