Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate
Authors:
Top Cited Papers
- 16 August 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (9) , 5811-5823
Abstract
Index coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and efficient communication in wireless networks and in part by its connection to network coding. Optimal encoding schemes and efficient heuristics were studied in various settings, while also leading to new results for network coding such as improved gaps between linear and non-linear capacity as well as hardness of approximation. The problem of broadcasting with side information, a generalization of the index coding problem, begins with a sender and sets of users and messages. Each user possesses a subset of the messages and desires an additional message from the set. The sender wishes to broadcast a message so that on receipt of the broadcast each user can compute her desired message. The fundamental parameter of interest is the broadcast rate, β, the average communication cost for sufficiently long broadcasts. Though there have been many new nontrivial bounds on β by Bar-Yossef (2006), Lubetzky and Stav (2007), Alon (2008), and Blasiak (2011) there was no known polynomial-time algorithm for approximating β within a nontrivial factor, and the exact value of β remained unknown for all nontrivial instances. Using the information theoretic linear program introduced in Blasiak (2011), we give a polynomial-time algorithm for recognizing instances with β = 2 and pinpoint β precisely for various classes of graphs (e.g., various Cayley graphs of cyclic groups). Further, extending ideas from Ramsey theory, we give a polynomial-time algorithm with a nontrivial approximation ratio for computing β. Finally, we provide insight into the quality of previous bounds by giving constructions showing separations between β and the respective bounds. In particular, we construct graphs where β is uniformly bounded while its upper bound derived from the naïve encoding scheme is polynomially worse.Keywords
This publication has 16 references indexed in Scilit:
- Index Coding With Side InformationIEEE Transactions on Information Theory, 2011
- Nonlinear Index Coding Outperforming the Linear OptimumIEEE Transactions on Information Theory, 2009
- Broadcasting with Side Information2008
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraphJournal of Graph Theory, 2007
- Networks, Matroids, and Non-Shannon Information InequalitiesIEEE Transactions on Information Theory, 2007
- On the capacity of information networksIEEE Transactions on Information Theory, 2006
- Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clientsIEEE Transactions on Information Theory, 2006
- Insufficiency of Linear Coding in Network Information FlowIEEE Transactions on Information Theory, 2005
- Constructive Bounds for a Ramsey-Type ProblemGraphs and Combinatorics, 1997
- Randomized graph products, chromatic numbers, and the Lov sz ?-functionCombinatorica, 1997