Source broadcasting with unknown amount of receiver side information

Mei Feder; Nadav Shulman

doi:10.1109/ITW.2002.1115434

Source broadcasting with unknown amount of receiver side information

Mei Feder, Nadav Shulman

School of Electrical Engineering

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

Abstract

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.

Original language	English
Title of host publication	Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	127-130
Number of pages	4
ISBN (Electronic)	0780376293, 9780780376298
DOIs	https://doi.org/10.1109/ITW.2002.1115434
State	Published - 2002
Event	2002 IEEE Information Theory Workshop, ITW 2002 - Bangalore, India Duration: 20 Oct 2002 → 25 Oct 2002

Publication series

Name	Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

Conference

Conference	2002 IEEE Information Theory Workshop, ITW 2002
Country/Territory	India
City	Bangalore
Period	20/10/02 → 25/10/02

Access to Document

10.1109/ITW.2002.1115434

Cite this

@inproceedings{be4a28024bc644b9a98e67f67dc20735,

title = "Source broadcasting with unknown amount of receiver side information",

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

author = "Mei Feder and Nadav Shulman",

note = "Publisher Copyright: {\textcopyright} 2002 IEEE.; 2002 IEEE Information Theory Workshop, ITW 2002 ; Conference date: 20-10-2002 Through 25-10-2002",

year = "2002",

doi = "10.1109/ITW.2002.1115434",

language = "אנגלית",

series = "Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "127--130",

booktitle = "Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002",

address = "ארצות הברית",

}

Feder, M & Shulman, N 2002, Source broadcasting with unknown amount of receiver side information. in Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002., 1115434, Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002, Institute of Electrical and Electronics Engineers Inc., pp. 127-130, 2002 IEEE Information Theory Workshop, ITW 2002, Bangalore, India, 20/10/02. https://doi.org/10.1109/ITW.2002.1115434

Source broadcasting with unknown amount of receiver side information. / Feder, Mei; Shulman, Nadav.
Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002. Institute of Electrical and Electronics Engineers Inc., 2002. p. 127-130 1115434 (Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002).

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

TY - GEN

T1 - Source broadcasting with unknown amount of receiver side information

AU - Feder, Mei

AU - Shulman, Nadav

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 -

Source broadcasting with unknown amount of receiver side information

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this