Paper ID | N.1.1 | ||
Paper Title | The Langberg-Medard Multiple Unicast Conjecture: Stable 3-Pair Networks | ||
Authors | Kai Cai, Guangyue Han, The University of Hong Kong, China | ||
Session | N.1: Network Coding I | ||
Presentation | Lecture | ||
Track | Networking and Network Coding | ||
Manuscript | Click here to download the manuscript | ||
Virtual Presentation | Click here to watch in the Virtual Symposium | ||
Abstract | The Langberg-Medard multiple unicast conjecture claims that for a strongly reachable k-pair network, there exists a multi-flow with rate (1,1,...,1). In this paper, we show that the conjecture holds true for stable 3-pair networks. |
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia