• DocumentCode
    2681443
  • Title

    Solving the Single Rate 2-Pair Network Coding Problem with the A-Set Equation

  • Author

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

  • Author_Institution
    Inst. of Comput. Technol., Chinese Acad. of Sci., Beijing, China
  • fYear
    2011
  • fDate
    25-27 July 2011
  • Firstpage
    1
  • Lastpage
    4
  • 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 ∪ A2,1)∩(A1,1 ∩ A2,2) = 0, where Ai,j is 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.
  • Keywords
    network coding; set theory; A-set equation; cut-based algorithm; point-to-point network; single rate 2-pair network coding problem; Communication networks; Computers; Entropy; Network coding; Unicast; Xenon;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Coding (NetCod), 2011 International Symposium on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-61284-138-0
  • Type

    conf

  • DOI
    10.1109/ISNETCOD.2011.5979082
  • Filename
    5979082
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2681443