Mission impossible: Computing the network coding capacity region

@article{Chan2008MissionIC,
  title={Mission impossible: Computing the network coding capacity region},
  author={Terence Chan and Arthur J. Grant},
  journal={2008 IEEE International Symposium on Information Theory},
  year={2008},
  pages={320-324}
}
One of the main theoretical motivations for the emerging area of network coding is the achievability of the max-flow/min-cut rate for single source multicast. This can exceed the rate achievable with routing alone, and is achievable with linear network codes. The multi-source problem is more complicated. Computation of its capacity region is equivalent to determination of the set of all entropy functions Gamma*, which is non-polyhedral. The aim of this paper is to demonstrate that this… CONTINUE READING

Similar Papers

Citations

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

On secure network coding with uniform wiretap sets

  • 2013 International Symposium on Network Coding (NetCod)
  • 2012
VIEW 5 EXCERPTS
CITES RESULTS & BACKGROUND
HIGHLY INFLUENCED

On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal property

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

The Two-Unicast Problem

  • IEEE Transactions on Information Theory
  • 2015
VIEW 2 EXCERPTS
CITES BACKGROUND

Reverse edge cut-set bounds for secure network coding

  • 2014 IEEE International Symposium on Information Theory
  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND

Single-source/sink network error correction is as hard as multiple-unicast

  • 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND

Two-unicast is hard

  • 2014 IEEE International Symposium on Information Theory
  • 2014
VIEW 2 EXCERPTS
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

The Capacity Region for Multi-source Multi-sink Network Coding

  • 2007 IEEE International Symposium on Information Theory
  • 2007
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Capacity bounds for secure network coding

  • 2008 Australian Communications Theory Workshop
  • 2008
VIEW 2 EXCERPTS

A Security Condition for Multi-Source Linear Network Coding

  • 2007 IEEE International Symposium on Information Theory
  • 2007
VIEW 1 EXCERPT

Infinitely Many Information Inequalities

  • 2007 IEEE International Symposium on Information Theory
  • 2007
VIEW 1 EXCERPT

On the capacity of secure network coding

J. Feldman, T. Malkin, C. Stein, R. Servedio
  • 42nd Annual Allerton Conference on Communication, Control, and Computing, 2004.
  • 2004
VIEW 1 EXCERPT

Linear network coding

  • IEEE Trans. Information Theory
  • 2003
VIEW 2 EXCERPTS