An Equivalence Between Network Coding and Index Coding

DOI10.1109/TIT.2015.2414926zbMATH Open1359.94405arXiv1211.6660MaRDI QIDQ2978620FDOQ2978620

Authors: Michelle Effros, Salim El Rouayheb, Michael Langberg 

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1211.6660

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (7)

• Cooperative Multi-Sender Index Coding
• On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
• Bounding the Optimal Rate of the ICSI and ICCSI problem
• Fixed points of Boolean networks, guessing graphs, and coding theory
• The minrank of random graphs
• Finite dynamical systems, hat games, and coding theory
• Capacity Theorems for Distributed Index Coding

This page was built for publication: An Equivalence Between Network Coding and Index Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978620)