A rate-distortion approach to index coding

We view the index coding problem with an arbitrary number of source bits and potentially overlapping demands as an instance of rate-distortion with multiple receivers, each with distinct side information. By applying network-information-theoretic tools, we find the optimal rate for the special case in which each source bit is present at either all of the decoders, none of the decoders, all but one of the decoders, or all but two of the decoders.

[1]  Alex J. Grant,et al.  Rate Distortion With Side-Information at Many Decoders , 2009, IEEE Transactions on Information Theory.

[2]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, FOCS.

[3]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.

[4]  Aaron B. Wagner,et al.  General index coding with side information: Three decoder case , 2013, 2013 IEEE International Symposium on Information Theory.

[5]  Noga Alon,et al.  Broadcasting with Side Information , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[6]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[7]  Yitzhak Birk,et al.  Informed-source coding-on-demand (ISCOD) over broadcast channels , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[8]  Robert D. Kleinberg,et al.  Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate , 2013, IEEE Transactions on Information Theory.

[9]  Lele Wang,et al.  On the capacity region for index coding , 2013, 2013 IEEE International Symposium on Information Theory.

[10]  Toby Berger,et al.  Rate distortion when side information may be absent , 1985, IEEE Trans. Inf. Theory.