A Generalisation of Interlinked Cycle Structures and Their Index Coding Capacity (1901.06804v1)

Abstract: 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 capacity of OIC structures by giving an index code with length equal to the order of maximum acyclic induced subgraph (MAIS) of OIC structures.