Vaddi, Mahesh Babu and Rajan, B Sundar (2018) On the Conjectures on Optimality of Index Codes from Interlinked Cycle Cover Scheme. In: IEEE International Symposium on Information Theory (ISIT), JUN 17-22, 2018, Vail, CO, pp. 606-610.
PDF
ISIT_606_2018.pdf - Published Version Restricted to Registered users only Download (283kB) | Request a copy |
Abstract
The interlinked cycle (IC) structure, that generalizes cycles and cliques was defined by Thapa, Ong and Johnson. Interlinked-cycle-cover (ICC) scheme that leverages IC structures in digraphs to construct scalar linear index codes was proposed. Thapa et. al. conjectured that for any IC structure, the ICC scheme is optimal. It was also conjectured that for any digraph, the ICC scheme performs at least as well as the partial-clique-cover scheme. In this paper, we disprove both the conjectures. We also show that for a specific class of symmetric index coding problems, the performance of ICC scheme is equal to that of the partial-clique-cover scheme.
Item Type: | Conference Proceedings |
---|---|
Series.: | IEEE International Symposium on Information Theory |
Publisher: | IEEE |
Additional Information: | Copy right for this article belong to IEEE |
Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |
Date Deposited: | 22 Nov 2018 15:03 |
Last Modified: | 22 Nov 2018 15:03 |
URI: | http://eprints.iisc.ac.in/id/eprint/61130 |
Actions (login required)
View Item |