Max-Flow Min-Cut Theorem for Rényi Entropy in Communication Networks
(2011)
Presentation / Conference Contribution
Gadouleau, M., & Riis, S. (2011). Max-Flow Min-Cut Theorem for Rényi Entropy in Communication Networks.
Dr Maximilien Gadouleau's Outputs (5)
Network Coding Theorem for Dynamic Communication Networks (2011)
Presentation / Conference Contribution
Riis, S., & Gadouleau, M. (2011). Network Coding Theorem for Dynamic Communication Networks.
A Dispersion Theorem for Communication Networks Based on Term Sets (2011)
Presentation / Conference Contribution
Riis, S., & Gadouleau, M. (2011). A Dispersion Theorem for Communication Networks Based on Term Sets.
Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications (2011)
Journal Article
Gadouleau, M., & Riis, S. (2011). Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications. IEEE Transactions on Information Theory, 57(10), 6703-6717. https://doi.org/10.1109/tit.2011.2155618
A Matroid Framework for Noncoherent Random Network Communications (2011)
Journal Article
Gadouleau, M., & Goupil, A. (2011). A Matroid Framework for Noncoherent Random Network Communications. IEEE Transactions on Information Theory, 57(2), 1031-1045. https://doi.org/10.1109/tit.2010.2094818