Network Coding in Minimal Multicast Networks

Author(s):  
S.Y. el Rouayheb ◽  
C.N. Georghiades ◽  
A. Sprintson
2011 ◽  
Vol 19 (1) ◽  
pp. 265-274 ◽  
Author(s):  
Yuanzhe Xuan ◽  
Chin-Tau Lea

2008 ◽  
Vol 54 (6) ◽  
pp. 2798-2803 ◽  
Author(s):  
Tracey Ho ◽  
Ben Leong ◽  
Ralf Koetter ◽  
Muriel Medard ◽  
Michelle Effros ◽  
...  

2010 ◽  
Vol 2010 ◽  
pp. 1-11
Author(s):  
Qin Guo ◽  
Mingxing Luo ◽  
Lixiang Li ◽  
Yixian Yang

From the perspectives of graph theory and combinatorics theory we obtain some new upper bounds on the number of encoding nodes, which can characterize the coding complexity of the network coding, both in feasible acyclic and cyclic multicast networks. In contrast to previous work, during our analysis we first investigate the simple multicast network with source rateh=2, and thenh≥2. We find that for feasible acyclic multicast networks our upper bound is exactly the lower bound given by M. Langberg et al. in 2006. So the gap between their lower and upper bounds for feasible acyclic multicast networks does not exist. Based on the new upper bound, we improve the computational complexity given by M. Langberg et al. in 2009. Moreover, these results further support the feasibility of signatures for network coding.


2018 ◽  
Vol 66 (4) ◽  
pp. 1520-1533 ◽  
Author(s):  
Bin Li ◽  
Xiaoping Li ◽  
Ruonan Zhang ◽  
Wanbin Tang ◽  
Shaoqian Li

2008 ◽  
Vol 19 (5) ◽  
pp. 627-640 ◽  
Author(s):  
Kaikai Chi ◽  
Xiaohong Jiang ◽  
Susumu Horiguchi ◽  
Minyi Guo

Sign in / Sign up

Export Citation Format

Share Document