TY - GEN
T1 - Index coding with outerplanar side information
AU - Berliner, Y.
AU - Langberg, M.
PY - 2011
Y1 - 2011
N2 - We study the Index Coding problem with side information graphs which are outerplanar. For general side information graphs, linearly solving the Index Coding problem implies a linear solution to the general (non-multicast) Network Coding problem a central open problem in the field of network communication. For outerplanar side information graphs, we show that the Index Coding problem can be solved efficiently, and characterize its solution in terms of the clique cover size of the information graph at hand.
AB - We study the Index Coding problem with side information graphs which are outerplanar. For general side information graphs, linearly solving the Index Coding problem implies a linear solution to the general (non-multicast) Network Coding problem a central open problem in the field of network communication. For outerplanar side information graphs, we show that the Index Coding problem can be solved efficiently, and characterize its solution in terms of the clique cover size of the information graph at hand.
UR - https://www.scopus.com/pages/publications/80054824491
U2 - 10.1109/ISIT.2011.6034247
DO - 10.1109/ISIT.2011.6034247
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:80054824491
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 806
EP - 810
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2011 IEEE International Symposium on Information Theory, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -