Network information flow
Citations
3,660 citations
2,806 citations
Cites background or methods from "Network information flow"
...THE capacity of multicast networks with network coding was given in [1]....
[...]
...[1] showed that with network coding, as symbol size approaches infinity, a source can multicast information at a rate approaching the smallest minimum cut between the source and any receiver....
[...]
...Reference [1] shows that coding enables the multicast infor-...
[...]
...given by the max-flow min-cut bound of [1], in multisource...
[...]
...A cyclic graph with nodes and rate may also be converted to an expanded acyclic graph with nodes and rate at least , communication on which can be emulated over time steps on the original cyclic graph [1]....
[...]
2,628 citations
2,442 citations
References
45,034 citations
6,637 citations
"Network information flow" refers background in this paper
...Recently, there has been a lot of interest in factor graph [7], a graphical model which subsumes Markov random field, Bayesian network, and Tanner graph....
[...]
4,165 citations
3,660 citations
714 citations
"Network information flow" refers background in this paper
...In the past, most results in multiterminal source coding are generalizations of either the Slepian–Wolf problem [9] or the multiple descriptions problem [3]....
[...]