R
Randall Dougherty
Researcher at Ohio State University
Publications - 51
Citations - 2124
Randall Dougherty is an academic researcher from Ohio State University. The author has contributed to research in topics: Linear network coding & Matroid. The author has an hindex of 19, co-authored 51 publications receiving 2042 citations.
Papers
More filters
Journal ArticleDOI
Insufficiency of linear coding in network information flow
TL;DR: It is shown that the network coding capacity of this counterexample network is strictly greater than the maximum linear coding capacity over any finite field, so the network is not even asymptotically linearly solvable.
Journal ArticleDOI
Networks, Matroids, and Non-Shannon Information Inequalities
TL;DR: The Vamos network is constructed, and it is proved that Shannon-type information inequalities are insufficient even for computing network coding capacities of multiple-unicast networks.
Proceedings ArticleDOI
Six New Non-Shannon Information Inequalities
TL;DR: Six new unconstrained non-Shannon information inequalities in four variables are given, independent of each other and of the Zhang-Yeung inequality.
Proceedings ArticleDOI
Insufficiency of linear coding in network information flow
TL;DR: It is shown that the network coding capacity of this counterexample network is strictly greater than the maximum linear coding capacity over any finite field, so the network is not even asymptotically linearly solvable.
Journal ArticleDOI
Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks
Randall Dougherty,Kenneth Zeger +1 more
TL;DR: It is proved that for any finite directed acyclic network, there exists a corresponding multiple-unicast network, such that for every alphabet, each network is solvable if and only if the other is solable.