Solving the Single Rate 2-pair Network Coding Problem With the A-set Equation

摘要：

The single rate 2-pair network coding problem is investigated. It is shown that a 2-pair network N=(V, E, s1, s2, t1, t2) is solvable if and only if (A1,2∪A2,1) ∩ (A1,1∩A2,2)=Φ, where Ai,j is the union of the minimal cuts of the point-to-point network Ni,j=(V, E, si, tj). As a result, a cut-based algorithm can be obtained for solving the single rate 2-pair network coding problem.

作者: Kai Cai K.B.Letaief Pingyi Fan Rongquan Feng

作者单位: Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, H Department of Electronic Engineering, Tsinghua University, Beijing, China LMAM, School of Mathematical Sciences, Peking University, Beijing, China

会议类型: 国际会议

会议名称: 2011 International Symposium on Network Coding(2011网络编码国际会议 NETCOD 2011)

会议地点: 北京

会议语种:英文

页码: 1-4

在线出版日期: 2011-07-25（万方平台首次上网日期，不代表论文的发表时间）