An Equivalence between Network Coding and Index Coding

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.

💡 Research Summary

The paper establishes a full equivalence between the network coding problem and the index coding problem, extending previous connections that were limited to linear codes. After formally defining both problems—network coding as the task of transmitting information over a directed graph where each node may apply an arbitrary (linear or non‑linear) encoding function to its incoming packets, and index coding as a single broadcast scenario where each receiver has side information and requests a specific message—the authors construct a polynomial‑time reduction that maps any network coding instance to an index coding instance while preserving feasibility. The reduction works by treating each edge of the network as a “request” in the index coding formulation and by translating each node’s encoding operation into a set of side‑information constraints for a corresponding client. To accommodate non‑linear operations, the message alphabet in the index coding instance is enlarged so that every possible output of a node’s function can be represented as a distinct broadcast symbol. The resulting index coding instance has a number of clients and messages that grow linearly with the size of the original graph, guaranteeing that the transformation is efficient.

The authors prove a bidirectional feasibility equivalence: if the original network can be satisfied with a total of ℓ transmitted symbols, then the constructed index coding instance admits a broadcast of length ℓ, and conversely any feasible index code of length ℓ can be translated back into a feasible network code of the same length. This equivalence immediately transfers complexity results from index coding to network coding. For example, the known NP‑hardness of finding optimal index codes implies that determining the optimal network code length is also NP‑hard. Likewise, lower‑bound techniques based on graph coloring or min‑rank for index coding become applicable to network coding.

The paper also presents explicit examples where non‑linear coding is essential. Certain network topologies cannot achieve the optimal transmission rate with linear functions alone; the reduction shows that the corresponding index coding instances also require non‑linear broadcast codes to meet the lower bound. These examples demonstrate that the new reduction captures the full expressive power of network coding, something linear‑only reductions miss.

Finally, the authors discuss practical implications and future work. While the theoretical reduction is polynomial, the blow‑up in the message alphabet may be large for very big networks, suggesting a need for more compact constructions in practice. They also propose exploring hybrid coding schemes that combine linear and non‑linear components, leveraging the unified framework to analyze their performance. In summary, the paper provides a rigorous, general‑purpose bridge between network coding and index coding, opening the door for cross‑fertilization of algorithms, hardness results, and design techniques across the two domains.