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 -