Network coding for two-unicast with rate (1,2)

Wentu Song; Rongquan Feng; Kai Cai; Junshan Zhang

doi:10.1109/ISIT.2012.6283631

Network coding for two-unicast with rate (1,2)

Wentu Song, Rongquan Feng, Kai Cai, Junshan Zhang

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

1 Scopus citations

Abstract

We consider a directed acyclic network with two source-sink pairs {s ₁, t ₁} and {s ₂, t ₂}. The source s ₁ wishes to communicate a message X ₁ to the sink t ₁ and the source s ₂ wishes to communicate two messages X ₂ and X ₃ to the sink t ₂, where X _i, i = 1,2,3, are independent random variables of unit rate. We give a simple characterization for linear solvability of such networks under the condition that the minimum cut from {s ₁, s ₂} to t ₂ equals 3. We develop a region decomposition method for proving this result, which we believe can be an effective approach for non-multicast network coding problem.

Original language	English (US)
Title of host publication	2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages	1912-1916
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2012.6283631
State	Published - Oct 22 2012
Event	2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: Jul 1 2012 → Jul 6 2012

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings

Other

Other	2012 IEEE International Symposium on Information Theory, ISIT 2012
Country	United States
City	Cambridge, MA
Period	7/1/12 → 7/6/12

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2012.6283631

Fingerprint Dive into the research topics of 'Network coding for two-unicast with rate (1,2)'. Together they form a unique fingerprint.

Cite this

Song, W., Feng, R., Cai, K., & Zhang, J. (2012). Network coding for two-unicast with rate (1,2). In 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012 (pp. 1912-1916). [6283631] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2012.6283631

Song, W, Feng, R, Cai, K & Zhang, J 2012, Network coding for two-unicast with rate (1,2). in 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012., 6283631, IEEE International Symposium on Information Theory - Proceedings, pp. 1912-1916, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 7/1/12. https://doi.org/10.1109/ISIT.2012.6283631

@inproceedings{1e7e5352921f4870ae943120eda86322,

title = "Network coding for two-unicast with rate (1,2)",

abstract = "We consider a directed acyclic network with two source-sink pairs {s 1, t 1} and {s 2, t 2}. The source s 1 wishes to communicate a message X 1 to the sink t 1 and the source s 2 wishes to communicate two messages X 2 and X 3 to the sink t 2, where X i, i = 1,2,3, are independent random variables of unit rate. We give a simple characterization for linear solvability of such networks under the condition that the minimum cut from {s 1, s 2} to t 2 equals 3. We develop a region decomposition method for proving this result, which we believe can be an effective approach for non-multicast network coding problem.",

author = "Wentu Song and Rongquan Feng and Kai Cai and Junshan Zhang",

year = "2012",

month = oct,

day = "22",

doi = "10.1109/ISIT.2012.6283631",

language = "English (US)",

isbn = "9781467325790",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1912--1916",

booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",

note = "2012 IEEE International Symposium on Information Theory, ISIT 2012 ; Conference date: 01-07-2012 Through 06-07-2012",

}

TY - GEN

T1 - Network coding for two-unicast with rate (1,2)

AU - Song, Wentu

AU - Feng, Rongquan

AU - Cai, Kai

AU - Zhang, Junshan

PY - 2012/10/22

Y1 - 2012/10/22

N2 - We consider a directed acyclic network with two source-sink pairs {s 1, t 1} and {s 2, t 2}. The source s 1 wishes to communicate a message X 1 to the sink t 1 and the source s 2 wishes to communicate two messages X 2 and X 3 to the sink t 2, where X i, i = 1,2,3, are independent random variables of unit rate. We give a simple characterization for linear solvability of such networks under the condition that the minimum cut from {s 1, s 2} to t 2 equals 3. We develop a region decomposition method for proving this result, which we believe can be an effective approach for non-multicast network coding problem.

AB - We consider a directed acyclic network with two source-sink pairs {s 1, t 1} and {s 2, t 2}. The source s 1 wishes to communicate a message X 1 to the sink t 1 and the source s 2 wishes to communicate two messages X 2 and X 3 to the sink t 2, where X i, i = 1,2,3, are independent random variables of unit rate. We give a simple characterization for linear solvability of such networks under the condition that the minimum cut from {s 1, s 2} to t 2 equals 3. We develop a region decomposition method for proving this result, which we believe can be an effective approach for non-multicast network coding problem.

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

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

U2 - 10.1109/ISIT.2012.6283631

DO - 10.1109/ISIT.2012.6283631

M3 - Conference contribution

AN - SCOPUS:84867550577

SN - 9781467325790

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1912

EP - 1916

BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012

T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012

Y2 - 1 July 2012 through 6 July 2012

ER -