Edge-Cut Bounds on Network Coding Rates
Citations
4 citations
4 citations
4 citations
Cites background from "Edge-Cut Bounds on Network Coding R..."
...Besides the FD bound, the cut-set bound, the PdE bound [4], the network sharing bound [5] and the bounds based on information dominance [6] are well known edge-cut bounds in the literature....
[...]
3 citations
3 citations
References
45,034 citations
Additional excerpts
...7, we choose Ed = {(2, 3), (4, 3), (2, 5), (4, 5)}, Sd = {1, 2, 3}, [π(1), π(2), π(3)] = [3, 1, 2] and the resulting graph GEd is shown in Fig....
[...]
...7 we choose Ed = {(3, 2), (3, 4), (5, 2), (5, 4)}, Sd = {2, 3}, [π(1), π(2)] = [2, 3]....
[...]
15,671 citations
8,533 citations
"Edge-Cut Bounds on Network Coding R..." refers background in this paper
...For example, it is known that linear network coding is optimal for multicasting a single source in directed networks [1], [9]....
[...]
...The terminals can further perform network coding [1], [9], i....
[...]
...7, we choose Ed = {(2, 3), (4, 3), (2, 5), (4, 5)}, Sd = {1, 2, 3}, [π(1), π(2), π(3)] = [3, 1, 2] and the resulting graph GEd is shown in Fig....
[...]
...Network coding has been intensely studied since [1] presented a novel coding scheme that attains a cut-set bound for multicasting in networks....
[...]
[...]
4,341 citations
2,825 citations