### 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 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 | |

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

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

## Cite this

*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