File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ISIT.2015.7282478
- Scopus: eid_2-s2.0-84969793695
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: On network coding advantage for multiple unicast networks
Title | On network coding advantage for multiple unicast networks |
---|---|
Authors | |
Keywords | Multiple unicast network coding conjecture Multiflow |
Issue Date | 2015 |
Publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369 |
Citation | The 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, 14-19 June 2015. In IEEE International Symposium on Information Theory Proceedings, 2015, p. 366-370 How to Cite? |
Abstract | In this paper, by studying the feasible fractional routing solution under the so-called full reachability condition, we give bounds on the network coding advantage for undirected multiple unicast networks. More precisely, we prove that, for certain class of fully reachable networks, the network coding advantage is upper bounded by 9/8, improving the previous bound 3 by M. Langberg and M. Médard. |
Persistent Identifier | http://hdl.handle.net/10722/218964 |
ISBN | |
ISSN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cai, K | - |
dc.contributor.author | Han, G | - |
dc.date.accessioned | 2015-09-18T07:02:21Z | - |
dc.date.available | 2015-09-18T07:02:21Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | The 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, 14-19 June 2015. In IEEE International Symposium on Information Theory Proceedings, 2015, p. 366-370 | - |
dc.identifier.isbn | 978-1-4673-7704-1 | - |
dc.identifier.issn | 0271-4655 | - |
dc.identifier.uri | http://hdl.handle.net/10722/218964 | - |
dc.description.abstract | In this paper, by studying the feasible fractional routing solution under the so-called full reachability condition, we give bounds on the network coding advantage for undirected multiple unicast networks. More precisely, we prove that, for certain class of fully reachable networks, the network coding advantage is upper bounded by 9/8, improving the previous bound 3 by M. Langberg and M. Médard. | - |
dc.language | eng | - |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369 | - |
dc.relation.ispartof | IEEE International Symposium on Information Theory Proceedings | - |
dc.rights | IEEE International Symposium on Information Theory Proceedings. Copyright © IEEE. | - |
dc.rights | ©2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
dc.subject | Multiple unicast network coding conjecture | - |
dc.subject | Multiflow | - |
dc.title | On network coding advantage for multiple unicast networks | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Cai, K: kcai@hku.hk | - |
dc.identifier.email | Han, G: ghan@hku.hk | - |
dc.identifier.authority | Han, G=rp00702 | - |
dc.description.nature | link_to_OA_fulltext | - |
dc.identifier.doi | 10.1109/ISIT.2015.7282478 | - |
dc.identifier.scopus | eid_2-s2.0-84969793695 | - |
dc.identifier.hkuros | 253250 | - |
dc.identifier.spage | 366 | - |
dc.identifier.epage | 370 | - |
dc.publisher.place | United States | - |
dc.customcontrol.immutable | sml 151203 | - |
dc.identifier.issnl | 0271-4655 | - |