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

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

doi:10.1109/ISNETCOD.2011.5979082

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

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

^*Corresponding author for this work

Office of the President

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

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, {s₁, s₂}, {t₁, t₂}) 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	https://doi.org/10.1109/ISNETCOD.2011.5979082
Publication status	Published - 2011
Event	2011 International Symposium on Network Coding, NETCOD 2011 - Beijing, China Duration: 25 Jul 2011 → 27 Jul 2011

Publication series

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

Conference

Conference	2011 International Symposium on Network Coding, NETCOD 2011
Country/Territory	China
City	Beijing
Period	25/07/11 → 27/07/11

Keywords

2-pair network
A-set
Capacity
Network coding

Access to Document

10.1109/ISNETCOD.2011.5979082

Cite this

@inproceedings{b1c8177b513342cca8b59efc0ef32cfd,

title = "Solving the single rate 2-pair network coding problem with the A-set equation",

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.",

keywords = "2-pair network, A-set, Capacity, Network coding",

author = "Kai Cai and Letaief, \{K. B.\} and Pingyi Fan and Rongquan Feng",

year = "2011",

doi = "10.1109/ISNETCOD.2011.5979082",

language = "English",

isbn = "9781612841403",

series = "2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings",

booktitle = "2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings",

note = "2011 International Symposium on Network Coding, NETCOD 2011 ; Conference date: 25-07-2011 Through 27-07-2011",

}

Cai, K, Letaief, KB, 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, 2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings, 2011 International Symposium on Network Coding, NETCOD 2011, Beijing, China, 25/07/11. 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 et al.
2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings. 2011. 5979082 (2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings).

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

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 - https://openalex.org/W2113037999

UR - https://www.scopus.com/pages/publications/80052983925

U2 - 10.1109/ISNETCOD.2011.5979082

DO - 10.1109/ISNETCOD.2011.5979082

M3 - Conference Paper published in a book

SN - 9781612841403

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

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

T2 - 2011 International Symposium on Network Coding, NETCOD 2011

Y2 - 25 July 2011 through 27 July 2011

ER -

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this