An extended least difference greedy clique-cover algorithm for index coding

In this paper, linear binary index coding is considered. It is shown that the minimum clique-cover heuristic algorithm can provide an efficient way to solving linear binary index coding problems. Based on the least difference greedy (LDG) clique-cover algorithm, an existing minimum clique-cover algorithm for index coding, proposed by Birk and Kol [1], [2], we develop an extended LDG algorithm by considering a transpose index coding model and cycle detection in the side information graph. Numerical results show that the proposed algorithm considerably outperforms the conventional LDG algorithm in terms of the number of transmissions.