Solving the Single Rate 2-Pair Network Coding Problem with the A-Set Equation
Kai Cai, Khaled B. Letaief, Pingyi Fan, Rongquan Feng · 2011
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) = 0, where Ai,jis the union of the minimal cuts of the point-to-point network Nij= (V, E, Si, tj). As a result, a cut-based algorithm can be obtained for solving the single rate 2-pair network coding problem.