Max-flow min-cut theorems on dispersion and entropy measures for communication networks (2019)
Attributed to:
Information flows and Information bottlenecks in Network Coding
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1016/j.ic.2019.03.004
Publication URI: http://dx.doi.org/10.1016/j.ic.2019.03.004
Type: Journal Article/Review
Parent Publication: Information and Computation