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

@article{Wong2013OnAC,
  title={On a capacity equivalence between network and index coding and the edge removal problem},
  author={Ming Fai Wong and Michael Langberg and Michelle Effros},
  journal={2013 IEEE International Symposium on Information Theory},
  year={2013},
  pages={972-976}
}
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. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 13 CITATIONS

Network Effects in Small Networks: A Study of Cooperation

VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A Local Perspective on the Edge Removal Problem

  • 2019 IEEE International Symposium on Information Theory (ISIT)
  • 2019
VIEW 1 EXCERPT
CITES BACKGROUND

A code equivalence between streaming network coding and streaming index coding

  • 2017 IEEE International Symposium on Information Theory (ISIT)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Strong Converses are Just Edge Removal Properties

  • IEEE Transactions on Information Theory
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

The effect of removing a network communication edge: Group network codes

  • 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2017

On the Capacity Advantage of a Single Bit

  • 2016 IEEE Globecom Workshops (GC Wkshps)
  • 2016
VIEW 1 EXCERPT

On the relationship between edge removal and strong converses

  • 2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

On tightness of an entropic region outer bound for network coding and the edge removal property

  • 2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

On the impact of a single edge on the network coding capacity

  • 2011 Information Theory and Applications Workshop
  • 2011
VIEW 5 EXCERPTS

Index Coding With Side Information

  • IEEE Trans. Information Theory
  • 2011
VIEW 1 EXCERPT

Network coding: Is zero error always possible?

  • 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2011

On capacity outer bounds for a simple family of wireless networks

  • 2010 Information Theory and Applications Workshop (ITA)
  • 2010

On equivalence between network topologies

  • 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2010
VIEW 3 EXCERPTS