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 (4)

• 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
• Lexicographic products and the power of non-linear network coding

Cited by in corpus (9)

• Topological Interference Management through Index Coding
• On the Capacity Region for Index Coding
• Fundamental Limits of Caching
• Local Graph Coloring and Index Coding
• Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff
• Index Coding Capacity: How far can one go with only Shannon Inequalities?
• Duality Codes and the Integrality Gap Bound for Index Coding
• Alignment based Network Coding for Two-Unicast-Z Networks
• A New Class of Index Coding Instances Where Linear Coding is Optimal