An equivalence between network coding and index coding

M. Effros, S. El Rouayheb, M. Langberg

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Scopus citations

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

Original languageAmerican English
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages967-971
Number of pages5
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: Jul 7 2013Jul 12 2013

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/TerritoryTurkey
CityIstanbul
Period7/7/137/12/13

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'An equivalence between network coding and index coding'. Together they form a unique fingerprint.

Cite this