### Abstract

We study two-unicast-Z networks^{1} - two-source two-destination (two-unicast) wireline networks over directed acyclic graphs, where one of the two destinations (say the second destination) is apriori aware of the interfering (first) source's message. For certain classes of two-unicast-Z networks, we show that the rate-tuple (N, 1) is achievable as long as the individual source-destination cuts for the two source-destination pairs are respectively at least as large as N and 1, and the generalized network sharing cut - a bound previously defined by Kamath et. al. - is at least as large as N +1. We show this through a novel achievable scheme which is based on random linear coding at all the edges in the network, except at the GNS-cut set edges, where the linear coding co-efficients are chosen in a structured manner to cancel interference at the receiver first destination.

Original language | English (US) |
---|---|

Title of host publication | 2013 IEEE International Symposium on Information Theory, ISIT 2013 |

Pages | 3085-3089 |

Number of pages | 5 |

DOIs | |

State | Published - Dec 19 2013 |

Event | 2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey Duration: Jul 7 2013 → Jul 12 2013 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|

ISSN (Print) | 2157-8095 |

### Other

Other | 2013 IEEE International Symposium on Information Theory, ISIT 2013 |
---|---|

Country | Turkey |

City | Istanbul |

Period | 7/7/13 → 7/12/13 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

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

### Cite this

*2013 IEEE International Symposium on Information Theory, ISIT 2013*(pp. 3085-3089). [6620793] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2013.6620793

}

*2013 IEEE International Symposium on Information Theory, ISIT 2013.*, 6620793, IEEE International Symposium on Information Theory - Proceedings, pp. 3085-3089, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, Turkey, 7/7/13. https://doi.org/10.1109/ISIT.2013.6620793

**On the tightness of the generalized network sharing bound for the two-unicast-Z network.** / Zeng, Weifei; Cadambe, Viveck Ramesh; Medard, Muriel.

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

TY - GEN

T1 - On the tightness of the generalized network sharing bound for the two-unicast-Z network

AU - Zeng, Weifei

AU - Cadambe, Viveck Ramesh

AU - Medard, Muriel

PY - 2013/12/19

Y1 - 2013/12/19

N2 - We study two-unicast-Z networks1 - two-source two-destination (two-unicast) wireline networks over directed acyclic graphs, where one of the two destinations (say the second destination) is apriori aware of the interfering (first) source's message. For certain classes of two-unicast-Z networks, we show that the rate-tuple (N, 1) is achievable as long as the individual source-destination cuts for the two source-destination pairs are respectively at least as large as N and 1, and the generalized network sharing cut - a bound previously defined by Kamath et. al. - is at least as large as N +1. We show this through a novel achievable scheme which is based on random linear coding at all the edges in the network, except at the GNS-cut set edges, where the linear coding co-efficients are chosen in a structured manner to cancel interference at the receiver first destination.

AB - We study two-unicast-Z networks1 - two-source two-destination (two-unicast) wireline networks over directed acyclic graphs, where one of the two destinations (say the second destination) is apriori aware of the interfering (first) source's message. For certain classes of two-unicast-Z networks, we show that the rate-tuple (N, 1) is achievable as long as the individual source-destination cuts for the two source-destination pairs are respectively at least as large as N and 1, and the generalized network sharing cut - a bound previously defined by Kamath et. al. - is at least as large as N +1. We show this through a novel achievable scheme which is based on random linear coding at all the edges in the network, except at the GNS-cut set edges, where the linear coding co-efficients are chosen in a structured manner to cancel interference at the receiver first destination.

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

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

U2 - 10.1109/ISIT.2013.6620793

DO - 10.1109/ISIT.2013.6620793

M3 - Conference contribution

SN - 9781479904464

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 3085

EP - 3089

BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013

ER -