Max-flow min-cut theorem for Rényi entropy in communication networks (2011)

First Author: Gadouleau M
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.1109/isit.2011.6034200

Publication URI: http://dx.doi.org/10.1109/isit.2011.6034200

Type: Conference/Paper/Proceeding/Abstract

ISBN: 978-1-4577-0596-0