Vaddi, MB and Rajan, BS (2019) A Generalisation of Interlinked Cycle Structures and Their Index Coding Capacity. In: 2019 IEEE International Symposium on Information Theory, ISIT 2019, 7 - 12 July 2019, Paris, pp. 1252-1256.
|
PDF
ISIT_2019.pdf - Published Version Download (302kB) | Preview |
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 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.
| Item Type: | Conference Paper |
|---|---|
| Publication: | IEEE International Symposium on Information Theory - Proceedings |
| Publisher: | Institute of Electrical and Electronics Engineers Inc. |
| Additional Information: | The copyright for this article belongs to the Authors. |
| Keywords: | Codes (symbols); Integrated circuits, Cycle structures; Generalisation; Graph structures; Index coding; Induced subgraphs; Number of transmissions; Side information, Graph theory |
| Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |
| Date Deposited: | 23 Oct 2022 06:25 |
| Last Modified: | 23 Oct 2022 06:25 |
| URI: | https://eprints.iisc.ac.in/id/eprint/77498 |
Actions (login required)
 |
View Item |
