An Equivalence between Network Coding and Index Coding

Abstract

We show that the network coding and index coding problems are equivalent. This equivalence holds in the general setting which includes linear and non-linear codes. Specifically, we present an efficient reduction that maps a network coding instance to an index coding one while preserving feasibility. Previous connections were restricted to the linear case.

References in corpus (3)

• Broadcasting with side information
• On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
• On the Relation Between the Index Coding and the Network Coding Problems

Cited by in corpus (2)

• Local Graph Coloring and Index Coding
• Index Coding Capacity: How far can one go with only Shannon Inequalities?