Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.