Optimal Linear Error Correcting Index Codes for Some Index Coding Problems

The symmetric capacity for index coding problems with $K$ messages and $K$ receivers, each demanding a unique message (Single Unicast Index Coding Problem) and having symmetric (with respect to receiver index), neighboring and consecutive side information (SUICP-SNC) have been reported by Maleki, Cadambe and Jafar. For these index coding problems, assuming that the transmissions are error prone, we present optimal length error-correcting index codes for all one-sided SUICP-SNC problems and for some cases of two-sided SUICP-SNC problems. We also discuss construction for these optimal Error Correcting Index Codes.

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

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

[3]  B. Sundar Rajan,et al.  Optimal Scalar Linear Index Codes for Some Symmetric Multiple Unicast Problems , 2015, ArXiv.

[4]  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).

[5]  B. Sundar Rajan,et al.  Optimal Scalar Linear Index Codes for One-Sided Neighboring Side-Information Problems , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[6]  Syed Ali Jafar,et al.  Index Coding - An Interference Alignment Perspective , 2014, IEEE Trans. Inf. Theory.

[7]  Yeow Meng Chee,et al.  Error Correction for Index Coding With Side Information , 2013, IEEE Transactions on Information Theory.

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