### Abstract

The single rate 2-pair network coding problem is investigated. It is shown that a 2-pair network N = (V,E, {s_{1}, s_{2}}, {t_{1}, t_{2}}) is solvable if and only if (A_{1,2} ∪ A _{2,1}) ∩ (A_{1,1} ∩ A_{2,2}) = ∅, where A_{i,j} is the union of the minimal cuts of the point-to-point network N_{i,j} = (V,E, s_{i}, t_{j}). As a result, a cut-based algorithm can be obtained for solving the single rate 2-pair network coding problem.

Original language | English |
---|---|

Title of host publication | 2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings |

DOIs | |

Publication status | Published - 2011 |

Externally published | Yes |

Event | 2011 International Symposium on Network Coding, NETCOD 2011 - Beijing, China Duration: 25 Jul 2011 → 27 Jul 2011 |

### Other

Other | 2011 International Symposium on Network Coding, NETCOD 2011 |
---|---|

Country | China |

City | Beijing |

Period | 25/7/11 → 27/7/11 |

### Fingerprint

### Keywords

- 2-pair network
- A-set
- Capacity
- Network coding

### ASJC Scopus subject areas

- Computer Networks and Communications
- Computer Science Applications

### Cite this

*2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings*[5979082] https://doi.org/10.1109/ISNETCOD.2011.5979082

**Solving the single rate 2-pair network coding problem with the A-set equation.** / Cai, Kai; Letaief, K. B.; Fan, Pingyi; Feng, Rongquan.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings.*, 5979082, 2011 International Symposium on Network Coding, NETCOD 2011, Beijing, China, 25/7/11. https://doi.org/10.1109/ISNETCOD.2011.5979082

}

TY - GEN

T1 - Solving the single rate 2-pair network coding problem with the A-set equation

AU - Cai, Kai

AU - Letaief, K. B.

AU - Fan, Pingyi

AU - Feng, Rongquan

PY - 2011

Y1 - 2011

N2 - 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 ∪ A 2,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.

AB - 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 ∪ A 2,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.

KW - 2-pair network

KW - A-set

KW - Capacity

KW - Network coding

UR - http://www.scopus.com/inward/record.url?scp=80052983925&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052983925&partnerID=8YFLogxK

U2 - 10.1109/ISNETCOD.2011.5979082

DO - 10.1109/ISNETCOD.2011.5979082

M3 - Conference contribution

AN - SCOPUS:80052983925

SN - 9781612841403

BT - 2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings

ER -