Some new results on index coding when the number of data is less than the number of receivers

In this paper, index coding problems in which the number (m) of receivers is larger than that (n) of data are considered. Unlike the case that the two numbers are same (n = m), index coding problems with n ≤ m are more general and hard to handle. To circumvent this difficulty, problems with n <; m are approached via corresponding problems with n = m. It is shown that in certain cases, the symmetric capacity and code construction for index coding problems with n <; m can be obtained from the existing symmetric capacity result and codes for index coding problems with n = m. Such cases include cases with n <; m ≤ 5.

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

[2]  Alexandros G. Dimakis,et al.  Bipartite index coding , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[4]  Alexandros G. Dimakis,et al.  Local graph coloring and index coding , 2013, 2013 IEEE International Symposium on Information Theory.

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

[6]  Yitzhak Birk,et al.  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients , 2006, IEEE Transactions on Information Theory.

[7]  Syed Ali Jafar.  Wireless index coding , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

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