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

Network coding

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

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

2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings. 2011. 5979082.

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

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, Beijing, China, 25/7/11. https://doi.org/10.1109/ISNETCOD.2011.5979082
Cai K, Letaief KB, Fan P, Feng R. Solving the single rate 2-pair network coding problem with the A-set equation. In 2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings. 2011. 5979082 https://doi.org/10.1109/ISNETCOD.2011.5979082
Cai, Kai ; Letaief, K. B. ; Fan, Pingyi ; Feng, Rongquan. / Solving the single rate 2-pair network coding problem with the A-set equation. 2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings. 2011.
@inproceedings{233727af4dbd4842b4b24f11395bb080,
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",
booktitle = "2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings",

}

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

SN - 9781612841403

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

ER -