TY - GEN
T1 - An equivalence between network coding and index coding
AU - Effros, M.
AU - El Rouayheb, S.
AU - Langberg, M.
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84890341396
U2 - 10.1109/ISIT.2013.6620370
DO - 10.1109/ISIT.2013.6620370
M3 - Conference contribution
AN - SCOPUS:84890341396
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 967
EP - 971
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -