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

Wentu Song, Rongquan Feng, Kai Cai, Junshan Zhang

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

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages1912-1916
Number of pages5
DOIs
StatePublished - Oct 22 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: Jul 1 2012Jul 6 2012

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Other

Other2012 IEEE International Symposium on Information Theory, ISIT 2012
CountryUnited States
CityCambridge, MA
Period7/1/127/6/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

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