TY - GEN
T1 - On a capacity equivalence between network and index coding and the edge removal problem
AU - Wong, M. F.
AU - Langberg, M.
AU - Effros, M.
PY - 2013
Y1 - 2013
N2 - In recent work by Effros, El Rouayheb, and Langberg, an equivalence of code feasibility between network and index coding is derived. The authors ask whether the capacity region of a network coding problem can be obtained by solving the capacity region of an index coding problem. We answer in the affirmative for the linear coding case. While the question is still open for the general case, we show that it is related to the edge removal problem, which has been studied recently.
AB - In recent work by Effros, El Rouayheb, and Langberg, an equivalence of code feasibility between network and index coding is derived. The authors ask whether the capacity region of a network coding problem can be obtained by solving the capacity region of an index coding problem. We answer in the affirmative for the linear coding case. While the question is still open for the general case, we show that it is related to the edge removal problem, which has been studied recently.
UR - https://www.scopus.com/pages/publications/84890349793
U2 - 10.1109/ISIT.2013.6620371
DO - 10.1109/ISIT.2013.6620371
M3 - Conference contribution
AN - SCOPUS:84890349793
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 972
EP - 976
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 -