Broadcasting with coded side information

In the original index coding problem, each user has a set of uncoded packets as side information, and wants to decode some other packets from the source node. The source node aims at satisfying the demands of all users as quickly as possible. With linear network coding, this is accomplished by broadcasting linear combinations of the source packets over some finite field. Since the broadcast is performed over a wireless channel, a user may overhear some coded packets that are not intended to him/her. This motivates a generalization of the index coding problem to the case where linearly coded packets are used as side information. We show that this generalized linear index coding problem is equivalent to solving a system of multi-variable polynomial equations. A heuristic solution is constructed and is applied to the broadcast relay channel.

[1]  Muriel Médard,et al.  Joint Scheduling and Instantaneously Decodable Network Coding , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[2]  Chih-Chun Wang.  On the Capacity of 1-to-K Broadcast Packet Erasure Channels With Channel Output Feedback , 2012, IEEE Trans. Inf. Theory.

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

[4]  René Peeters,et al.  Orthogonal representations over finite fields and the chromatic number of graphs , 1996, Comb..

[5]  Richard D. Wesel,et al.  Coded Cooperative Data Exchange in Multihop Networks , 2012, IEEE Transactions on Information Theory.

[6]  Xiaojun Lin,et al.  On The Capacity of Immediately-Decodable Coding Schemes for Wireless Stored-Video Broadcast with Hard Deadline Constraints , 2011, IEEE Journal on Selected Areas in Communications.

[7]  Alexander Sprintson,et al.  On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory , 2008, IEEE Transactions on Information Theory.

[8]  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.

[9]  Michael Langberg,et al.  On the Hardness of Approximating the Network Coding Capacity , 2008, IEEE Transactions on Information Theory.

[10]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.

[11]  Willi Meier,et al.  Solving Underdefined Systems of Multivariate Quadratic Equations , 2002, Public Key Cryptography.

[12]  Lawrence Ong,et al.  Optimal index codes for a class of multicast networks with receiver side information , 2012, 2012 IEEE International Conference on Communications (ICC).

[13]  Chih-Chun Wang,et al.  On the Capacity of 1-to- $K$ Broadcast Packet Erasure Channels With Channel Output Feedback , 2010, IEEE Transactions on Information Theory.