TU3.R6.2

The Langberg-Medard Multiple Unicast Conjecture for Networks with Collapsed Backbone

Kai Cai, Guangyue Han, The University of Hong Kong, Hong Kong SAR of China
Session:
Network Coding 1
Track:
18: Network Coding and Applications
Location:
Sigma/Delta
Presentation Time:
Tue, 9 Jul, 14:45 - 15:05
Session Chair:
Michael Langberg,
Abstract
In this paper, we consider a strongly reachable multiple unicast network with $k$ pairs of sender and receivers, and we show that the Langberg-M\'{e}dard multiple unicast conjecture holds for such a network under the assumption that it is supported on a collapsed backbone that takes the form of rooted binary tree.
Session TU3.R6
TU3.R6.1: Characterizing positive-rate secure multicast network coding with eavesdropping nodes
Michael Langberg, University at Buffalo, United States; Michelle Effros, Caltech, United States
TU3.R6.2: The Langberg-Medard Multiple Unicast Conjecture for Networks with Collapsed Backbone
Kai Cai, Guangyue Han, The University of Hong Kong, Hong Kong SAR of China
TU3.R6.3: Distributionally Robust Degree Optimization for BATS Codes
Hoover H. F. Yin, The Chinese University of Hong Kong, Hong Kong SAR of China; Jie Wang, Georgia Institute of Technology, United States; Sherman S. M. Chow, The Chinese University of Hong Kong, Hong Kong SAR of China
TU3.R6.4: Efficient Binary Batched Network Coding employing Partial Recovery
Licheng Mao, Shenghao Yang, The Chinese University of Hong Kong, Shenzhen, China
Resources
View Manuscript