An Equivalence between Network Coding and Index Coding
classification
💻 cs.IT
cs.DMcs.NImath.IT
keywords
codingindexnetworkequivalencelinearcasecodesconnections
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.