A Caltech Library Service

An equivalence between network coding and index coding

Effros, M. and El Rouayheb, S. and Langberg, M. (2013) An equivalence between network coding and index coding. In: 2013 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, pp. 967-971. ISBN 978-1-4799-0446-4.

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


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 instance while preserving feasibility. Previous connections were restricted to the linear case.

Item Type:Book Section
Related URLs:
URLURL TypeDescription Paper
Langberg, M.0000-0002-7470-0718
Additional Information:© 2013 IEEE. This material is based upon work supported by ISF grant 480/08, BSF grant 2010075, and NSF grants CCF-1018741 and CCF-1016671. The work was done while Michael Langberg was visiting the California Institute of Technology. Authors appear in alphabetical order.
Funding AgencyGrant Number
Israel Science Foundation480/08
Binational Science Foundation (USA-Israel)2010075
Record Number:CaltechAUTHORS:20170125-152255596
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:73738
Deposited By: Kristin Buxton
Deposited On:25 Jan 2017 23:34
Last Modified:09 Mar 2020 13:18

Repository Staff Only: item control page