27 citations · 33 across the 6 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2011★ 4 cited
Computing Bounds on Network Capacity Regions as a Polytope Reconstruction Problem
Anthony Kim, Muriel Medard
We define a notion of network capacity region of networks that generalizes the notion of network capacity defined by Cannons et al. and prove its notable properties such as closedn…
cs.IT2010★ 27 cited
Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids
Anthony Kim, Muriel Medard
We study matroidal networks introduced by Dougherty et al. We prove the converse of the following theorem: If a network is scalar-linearly solvable over some finite field, then the…