An Equivalence between Network Coding and Index Coding
Michelle Effros, Salim El Rouayheb, Michael Langberg

TL;DR
This paper establishes a general equivalence between network coding and index coding problems, including both linear and non-linear codes, through an efficient reduction that preserves feasibility.
Contribution
It introduces a comprehensive reduction method that demonstrates the equivalence of network coding and index coding in the general case, extending previous linear-only results.
Findings
Network coding and index coding are equivalent in the general setting.
The reduction preserves feasibility between the two problems.
Previous connections were limited to linear codes.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Full-Duplex Wireless Communications · Wireless Communication Security Techniques
