Efficient algorithms for Index Coding

Chaudhry, Mohammad Asad Rehman; Sprintson, Alex

doi:10.1109/infocom.2008.4544612

Cited by 118 publications

(134 citation statements)

References 6 publications

Supporting

Mentioning

134

Contrasting

Order By: Relevance

“…It was recognized in [2,31] that the reciprocal of the symmetric rate achievable by the optimal scalar linear code over field F is equal to the minrank of the side information graph evaluated over F 7 . Algorithms for finding or approximating the minrank function are proposed in [32] and [23]. Haviv and Langberg in [24] investigated the minranks of random digraphs.…”

Section: Insufficiency Of Linear Codes For Multiple Unicast Index Codingmentioning

confidence: 99%

Index coding: An interference alignment perspective

Maleki

Cadambe

Jafar

2012

2012 IEEE International Symposium on Information Theory Proceedings

124

246

View full text Add to dashboard Cite

The index coding problem is studied from an interference alignment perspective providing new results as well as new insights into, and generalizations of, previously known results. An equivalence is established between the capacity of the multiple unicast index coding (where each message is desired by exactly one receiver), and groupcast index coding (where a message can be desired by multiple receivers), which settles the heretofore open question of insufficiency of linear codes for the multiple unicast index coding problem by equivalence with groupcast settings where this question has previously been answered. Necessary and sufficient conditions for the achievability of rate half per message in the index coding problem are shown to be a natural consequence of interference alignment constraints, and generalizations to feasibility of rateper message when each destination desires at least L messages, are similarly obtained. Finally, capacity optimal solutions are presented to a series of symmetric index coding problems inspired by the local connectivity and local interference characteristics of wireless networks. The solutions are based on vector linear coding. * Presented in part at ISIT 2012. Hamed Maleki and Syed Jafar (email: hmaleki@uci.edu, syed@uci.edu) are with the Center for Pervasive Communications and Computing (CPCC) at

show abstract

Section: Insufficiency Of Linear Codes For Multiple Unicast Index Codingmentioning

confidence: 99%

Index coding: An interference alignment perspective

Maleki

Cadambe

Jafar

2012

2012 IEEE International Symposium on Information Theory Proceedings

124

246

View full text Add to dashboard Cite

show abstract

“…The problem of delay minimization in IDNC for erasure free channels have been studied in the literature under the name of index coding (IC), introduced by Birk and Kol [77] previously and extensively studied in [78,79,80,81,82,83,84,85,86].…”

Section: Motivation Of Instantly Decodable Network Codingmentioning

confidence: 99%

“…This graph model was first introduced in [80,78] as a heuristic algorithm to solve the index coding problem.…”

Section: Graph Representationmentioning

confidence: 99%

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

Douik

Sorour

Al-Naffouri

et al. 2017

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications Ahmed DouikFrom its introduction to its quindecennial, network coding has built a strong reputation in enhancing the packet recovery process and achieving maximum information flow in both wired and wireless networks. Traditional studies focused on optimizing the throughput of the network by proposing complex schemes that achieve optimal delay. With the shift toward distributed computing on mobile devices, throughput and complexity become both critical factors that affect the efficiency of a coding scheme. Instantly decodable network coding imposed itself as a new paradigm in network coding that trades off these two aspects. This paper presents a survey of instantly decodable network coding schemes that are proposed in the literature. The various schemes are identified, categorized and evaluated. Two categories can be distinguished namely the conventional centralized schemes and the distributed or cooperative schemes. For each scheme, the comparison is carried out in terms of reliability, performance, complexity and packet selection methodology. Although the performance is generally inversely proportional to the computation complexity, numerous successful schemes from both the performance and complexity viewpoint are identified.

show abstract

“…We need to find an illustration of the possible message combinations, those are decodable at the same instant by all the users or any subset of them. In [34,35,36] …”

Section: Idnc Graphmentioning

confidence: 99%