A Generalisation of Interlinked Cycle Structures and Their Index Coding Capacity

Cycles and Cliques in a side-information graph reduce the number of transmissions required in an index coding problem. Thapa, Ong and Johnson defined a more general form of overlapping cycles, called the interlinked-cycle (IC) structure, that generalizes cycles and cliques. They proposed a scheme, that leverages IC structures in digraphs to construct scalar linear index codes. In this paper, we extend the notion of interlinked cycle structure to define more generalised graph structures called overlapping interlinked cycle (OIC) structures. We prove the index coding capacity of OIC structures by giving an index code with length equal to the order of maximum acyclic induced subgraph (MAIS) of OIC structures.

[1]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

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

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

[4]  B. Sundar Rajan,et al.  Optimal Index Codes for a New Class of Interlinked Cycle Structure , 2018, IEEE Communications Letters.

[5]  Lawrence Ong,et al.  Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques , 2016, IEEE Transactions on Information Theory.

[6]  B. Sundar Rajan,et al.  Low-Complexity Decoding for Symmetric, Neighboring and Consecutive Side-information Index Coding Problems , 2017, ArXiv.

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

[8]  B. Sundar Rajan,et al.  On the Conjectures on Optimality of Index Codes from Interlinked Cycle Cover Scheme , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[9]  Lawrence Ong,et al.  Corrections to "Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques" , 2018, IEEE Trans. Inf. Theory.

[10]  Rina Dechter.  Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms , 2013, Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms.

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

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