Published July 2013
| Version Submitted
Book Section - Chapter
Open
An equivalence between network coding and index coding
Creators
-
1.
California Institute of Technology
-
2.
Princeton University
-
3.
Open University of Israel
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.
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.Attached Files
Submitted - 1211.6660.pdf
Files
1211.6660.pdf
Additional details
Identifiers
- Eprint ID
- 73738
- DOI
- 10.1109/ISIT.2013.6620370
- Resolver ID
- CaltechAUTHORS:20170125-152255596
Related works
- Describes
- https://arxiv.org/abs/1211.6660 (URL)
Funding
- Israel Science Foundation
- 480/08
- Binational Science Foundation (USA-Israel)
- 2010075
- NSF
- CCF-1018741
- NSF
- CCF-1016671
Dates
- Created
-
2017-01-25Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field