Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 2013 | public
Book Section - Chapter

On a capacity equivalence between network and index coding and the edge removal problem

Abstract

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.

Additional Information

© 2013 IEEE. This material is based upon work supported by the National Science Foundation under Grant No. CCF-1018741 and ISF grant 480/08. This work was done while M. Langberg was at the California Institute of Technology, he would like to thank S. Jafar for suggesting to study Theorem 2, and S. El Rouayheb for helpful discussions.

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023