Dr Maximilien Gadouleau m.r.gadouleau@durham.ac.uk
Associate Professor
Max-Flow Min-Cut Theorem for Rényi Entropy in Communication Networks
Gadouleau, Maximilien; Riis, Søren
Authors
Søren Riis
Citation
Gadouleau, M., & Riis, S. (2011, December). Max-Flow Min-Cut Theorem for Rényi Entropy in Communication Networks. Presented at IEEE International Symposium on Information Theory, St Petersburg, Russia
| Presentation Conference Type | Conference Paper (published) |
|---|---|
| Conference Name | IEEE International Symposium on Information Theory |
| Publication Date | 2011 |
| Deposit Date | Feb 28, 2012 |
| Pages | 677-681 |
| Public URL | https://durham-repository.worktribe.com/output/1156893 |
You might also like
Factorisation in the semiring of finite dynamical systems
(2024)
Journal Article
Graphs with minimum fractional domatic number
(2023)
Journal Article
Bent functions in the partial spread class generated by linear recurring sequences
(2022)
Journal Article
Expansive automata networks
(2020)
Journal Article
Elementary, finite and linear vN-regular cellular automata
(2020)
Journal Article