Broadcasting with side information

Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A sender holds a word x consisting of n blocks xi, each of t bits, and wishes to broadcast a codeword to m receivers, R1,..., Rm. Each receiver Ri is interested in one block, and has prior side information consisting of some subset of the other blocks. Let βt be the minimum number of bits that has to be transmitted when each block is of length t, and let β be the limit β= lim →Infin; βt/t. Informally, β is the average communication cost per bit in each block (for long blocks). Finding the coding rate β, for such an informed broadcast setting, generalizes several coding theoretic parameters related to Informed Source Coding on Demand, Index Coding and Network Coding. In this work we show that usage of large data blocks may strictly improve upon the trivial encoding which treats each bit in the block independently. To this end, we provide general bounds on βt, and prove that for any constant C there is an explicit broadcast setting in which β= 2 but β1 > C. One of these examples answers a question of [15]. In addition, we provide examples with the following counterintuitive direct-sum phenomena. Consider a union of several mutually independent broadcast settings. The optimal code for the combined setting may yield a significant saving in communication over concatenating optimal encodings for the individual settings. This result also provides new non-linear coding schemes which improve upon the largest known gap between linear and non-linear Network Coding, thus improving the results of [8]. The proofs are based on a relation between this problem and results in the study of Witsenhausen's rate, OR graph products, colorings of Cayley graphs, and the chromatic numbers of Kneser graphs.

Original languageEnglish (US)
Title of host publicationProceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008
Pages823-832
Number of pages10
DOIs
StatePublished - 2008
Event49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 - Philadelphia, PA, United States
Duration: Oct 25 2008Oct 28 2008

Other

Other49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008
CountryUnited States
CityPhiladelphia, PA
Period10/25/0810/28/08

Fingerprint

Broadcasting
Network coding
Nonlinear networks
Communication
Coloring
Costs

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Alon, N., Hassidim, A., Lubetzky, E., Stav, U., & Weinstein, A. (2008). Broadcasting with side information. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 (pp. 823-832). [4691014] https://doi.org/10.1109/FOCS.2008.41

Broadcasting with side information. / Alon, Noga; Hassidim, Avinatan; Lubetzky, Eyal; Stav, Uri; Weinstein, Amit.

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. 2008. p. 823-832 4691014.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Alon, N, Hassidim, A, Lubetzky, E, Stav, U & Weinstein, A 2008, Broadcasting with side information. in Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008., 4691014, pp. 823-832, 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, Philadelphia, PA, United States, 10/25/08. https://doi.org/10.1109/FOCS.2008.41
Alon N, Hassidim A, Lubetzky E, Stav U, Weinstein A. Broadcasting with side information. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. 2008. p. 823-832. 4691014 https://doi.org/10.1109/FOCS.2008.41
Alon, Noga ; Hassidim, Avinatan ; Lubetzky, Eyal ; Stav, Uri ; Weinstein, Amit. / Broadcasting with side information. Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. 2008. pp. 823-832
@inproceedings{eadc1e11f5b74711832a26d60deb8aae,
title = "Broadcasting with side information",
abstract = "A sender holds a word x consisting of n blocks xi, each of t bits, and wishes to broadcast a codeword to m receivers, R1,..., Rm. Each receiver Ri is interested in one block, and has prior side information consisting of some subset of the other blocks. Let βt be the minimum number of bits that has to be transmitted when each block is of length t, and let β be the limit β= lim →Infin; βt/t. Informally, β is the average communication cost per bit in each block (for long blocks). Finding the coding rate β, for such an informed broadcast setting, generalizes several coding theoretic parameters related to Informed Source Coding on Demand, Index Coding and Network Coding. In this work we show that usage of large data blocks may strictly improve upon the trivial encoding which treats each bit in the block independently. To this end, we provide general bounds on βt, and prove that for any constant C there is an explicit broadcast setting in which β= 2 but β1 > C. One of these examples answers a question of [15]. In addition, we provide examples with the following counterintuitive direct-sum phenomena. Consider a union of several mutually independent broadcast settings. The optimal code for the combined setting may yield a significant saving in communication over concatenating optimal encodings for the individual settings. This result also provides new non-linear coding schemes which improve upon the largest known gap between linear and non-linear Network Coding, thus improving the results of [8]. The proofs are based on a relation between this problem and results in the study of Witsenhausen's rate, OR graph products, colorings of Cayley graphs, and the chromatic numbers of Kneser graphs.",
author = "Noga Alon and Avinatan Hassidim and Eyal Lubetzky and Uri Stav and Amit Weinstein",
year = "2008",
doi = "10.1109/FOCS.2008.41",
language = "English (US)",
isbn = "9780769534367",
pages = "823--832",
booktitle = "Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008",

}

TY - GEN

T1 - Broadcasting with side information

AU - Alon, Noga

AU - Hassidim, Avinatan

AU - Lubetzky, Eyal

AU - Stav, Uri

AU - Weinstein, Amit

PY - 2008

Y1 - 2008

N2 - A sender holds a word x consisting of n blocks xi, each of t bits, and wishes to broadcast a codeword to m receivers, R1,..., Rm. Each receiver Ri is interested in one block, and has prior side information consisting of some subset of the other blocks. Let βt be the minimum number of bits that has to be transmitted when each block is of length t, and let β be the limit β= lim →Infin; βt/t. Informally, β is the average communication cost per bit in each block (for long blocks). Finding the coding rate β, for such an informed broadcast setting, generalizes several coding theoretic parameters related to Informed Source Coding on Demand, Index Coding and Network Coding. In this work we show that usage of large data blocks may strictly improve upon the trivial encoding which treats each bit in the block independently. To this end, we provide general bounds on βt, and prove that for any constant C there is an explicit broadcast setting in which β= 2 but β1 > C. One of these examples answers a question of [15]. In addition, we provide examples with the following counterintuitive direct-sum phenomena. Consider a union of several mutually independent broadcast settings. The optimal code for the combined setting may yield a significant saving in communication over concatenating optimal encodings for the individual settings. This result also provides new non-linear coding schemes which improve upon the largest known gap between linear and non-linear Network Coding, thus improving the results of [8]. The proofs are based on a relation between this problem and results in the study of Witsenhausen's rate, OR graph products, colorings of Cayley graphs, and the chromatic numbers of Kneser graphs.

AB - A sender holds a word x consisting of n blocks xi, each of t bits, and wishes to broadcast a codeword to m receivers, R1,..., Rm. Each receiver Ri is interested in one block, and has prior side information consisting of some subset of the other blocks. Let βt be the minimum number of bits that has to be transmitted when each block is of length t, and let β be the limit β= lim →Infin; βt/t. Informally, β is the average communication cost per bit in each block (for long blocks). Finding the coding rate β, for such an informed broadcast setting, generalizes several coding theoretic parameters related to Informed Source Coding on Demand, Index Coding and Network Coding. In this work we show that usage of large data blocks may strictly improve upon the trivial encoding which treats each bit in the block independently. To this end, we provide general bounds on βt, and prove that for any constant C there is an explicit broadcast setting in which β= 2 but β1 > C. One of these examples answers a question of [15]. In addition, we provide examples with the following counterintuitive direct-sum phenomena. Consider a union of several mutually independent broadcast settings. The optimal code for the combined setting may yield a significant saving in communication over concatenating optimal encodings for the individual settings. This result also provides new non-linear coding schemes which improve upon the largest known gap between linear and non-linear Network Coding, thus improving the results of [8]. The proofs are based on a relation between this problem and results in the study of Witsenhausen's rate, OR graph products, colorings of Cayley graphs, and the chromatic numbers of Kneser graphs.

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

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

U2 - 10.1109/FOCS.2008.41

DO - 10.1109/FOCS.2008.41

M3 - Conference contribution

SN - 9780769534367

SP - 823

EP - 832

BT - Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008

ER -