Index Coding With Side Information

By Ziv Bar-Yossef, Y. Birk, T. S. Jayram, T. Kol. IEEE Transactions on Information Theory, 2006

671 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/0bc7945e65e0e889de20a08c9fb071ce8cc3b3fd

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Fundamental Limits of Caching in Wireless D2D Networks (2014, methodology): “2It is interesting to notice that, for any set of user demands, this system reduces to a special instance of the general index coding problem [18]–[26].”
Topological Interference Management Through Index Coding (2013, background): “in [46] and generalized subsequently to the multiple groupcast setting by Neely et al.”
Private information retrieval with side information: The single server case (2017, background): “The above proposition enables us to show a relation of the PIR-SI problem with an instance of index coding with side information problem [25]–[27].”
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing (2016, background): “Generally speaking, we can view the Shuffle phase of the considered distributed computing framework as an instance of the index coding problem [27], [28], in which a central server aims to design a broadcast message (code) with minimum length to simultaneously satisfy the requests of all the clients”
Online Coded Caching (2013, background): “Since the long-term average of the optimal scheme is less than or equal to ¯ R , this implies ¯ R ⋆ ≤ ¯ R ≤ 2 R ( M, N, K ) + 6 , concluding the proof of the upper bound in Theorem 1.”
Speeding Up Distributed Machine Learning Using Codes (2015, background): “The coded shuffling problem that we study is related to the index coding problem [72], [73].”
Coded TeraSort (2017, methodology): “2This type of coding was also utilized to solve the index coding problem [19], [20] that arises from the network coding problem [21].”
Private Information Retrieval With Side Information (2017, background): “The above proposition enables us to show a relation of the PIR-SI problem with an instance of index coding with side information problem [25]–[27].”
Coded MapReduce (2015, background): “This type of coding is closely related to the network coding [15] problem and the index coding problem [16], [17].”
High-Reliability and Low-Latency Wireless Communication for Internet of Things: Challenges, Fundamentals, and Enabling Technologies (2019, background): “, two-way relay channels [142], [143], multihop unicast [144], and multiple unicast networks [145].”
The Capacity of Private Information Retrieval (2016, background): “A prominent example is the index coding problem [14], originally posed by computer scientists and recently studied from an information theoretic perspective.”
Decentralized coded caching attains order-optimal memory-rate tradeoff (2013, methodology): “gmentation approach just discussed to be efﬁcient. VI. DISCUSSION A. Connection to Index and Network Coding The caching problem considered in this paper is connected to the index coding problem [12], [13] (or, equivalently [14], to the network coding problem [15]). In the index coding problem, we ar”