TY - GEN

T1 - Source broadcasting with unknown amount of receiver side information

AU - Feder, Mei

AU - Shulman, Nadav

N1 - Publisher Copyright:
© 2002 IEEE.

PY - 2002

Y1 - 2002

N2 - The Slepian-Wolf scheme for source coding with side information at the receiver, assures that the sender can send the source X at a rate of only the conditional entropy H(X|Y-) bits per source symbol, which is the minimal possible rate even if the sender knew the side information Y. However, the Slepian-Wolf result requires knowledge of the optimal required rate. In this paper we consider a situation where this rate is not known, possibly since the source is broadcasted to many heterogeneous receivers. The approach is based on recent results regarding sending a common information over a broadcast channel.

AB - The Slepian-Wolf scheme for source coding with side information at the receiver, assures that the sender can send the source X at a rate of only the conditional entropy H(X|Y-) bits per source symbol, which is the minimal possible rate even if the sender knew the side information Y. However, the Slepian-Wolf result requires knowledge of the optimal required rate. In this paper we consider a situation where this rate is not known, possibly since the source is broadcasted to many heterogeneous receivers. The approach is based on recent results regarding sending a common information over a broadcast channel.

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

U2 - 10.1109/ITW.2002.1115434

DO - 10.1109/ITW.2002.1115434

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84939202757

T3 - Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

SP - 127

EP - 130

BT - Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2002 IEEE Information Theory Workshop, ITW 2002

Y2 - 20 October 2002 through 25 October 2002

ER -