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

Kai Cai, K. B. Letaief, Pingyi Fan, Rongquan Feng

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 International Symposium on Network Coding, NETCOD 2011 - Beijing, China
Duration: 25 Jul 201127 Jul 2011

Other

Other2011 International Symposium on Network Coding, NETCOD 2011
CountryChina
CityBeijing
Period25/7/1127/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

Cai, K., Letaief, K. B., Fan, P., & Feng, R. (2011). Solving the single rate 2-pair network coding problem with the A-set equation. In 2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings [5979082] https://doi.org/10.1109/ISNETCOD.2011.5979082