An Equivalence Between Network Coding and Index Coding

DOI10.1109/TIT.2015.2414926MaRDI QIDQ2978620zbMATH OpenFDO

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)

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

Mathematics Subject Classification ID

Source coding (94A29)

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.

Cited in

(7)

• The minrank of random graphs
• Bounding the Optimal Rate of the ICSI and ICCSI problem
• Fixed points of Boolean networks, guessing graphs, and coding theory
• Finite dynamical systems, hat games, and coding theory
• Cooperative Multi-Sender Index Coding
• On the Index Coding Problem and Its Relation to Network Coding and Matroid 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)