File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: On network coding advantage for multiple unicast networks

TitleOn network coding advantage for multiple unicast networks
Authors
Cai, KHan, G
KeywordsMultiple unicast network coding conjecture
Multiflow
Issue Date2015
PublisherIEEE. 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?
DOI: http://dx.doi.org/10.1109/ISIT.2015.7282478
AbstractIn 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 Identifierhttp://hdl.handle.net/10722/218964
ISBN
978-1-4673-7704-1
ISSN
0271-4655

 

DC FieldValueLanguage
dc.contributor.authorCai, K-
dc.contributor.authorHan, G-
dc.date.accessioned2015-09-18T07:02:21Z-
dc.date.available2015-09-18T07:02:21Z-
dc.date.issued2015-
dc.identifier.citationThe 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.isbn978-1-4673-7704-1-
dc.identifier.issn0271-4655-
dc.identifier.urihttp://hdl.handle.net/10722/218964-
dc.description.abstractIn 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.languageeng-
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369-
dc.relation.ispartofIEEE International Symposium on Information Theory Proceedings-
dc.rightsIEEE 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.subjectMultiple unicast network coding conjecture-
dc.subjectMultiflow-
dc.titleOn network coding advantage for multiple unicast networks-
dc.typeConference_Paper-
dc.identifier.emailCai, K: kcai@hku.hk-
dc.identifier.emailHan, G: ghan@hku.hk-
dc.identifier.authorityHan, G=rp00702-
dc.description.naturelink_to_OA_fulltext-
dc.identifier.doi10.1109/ISIT.2015.7282478-
dc.identifier.scopuseid_2-s2.0-84969793695-
dc.identifier.hkuros253250-
dc.identifier.spage366-
dc.identifier.epage370-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 151203-
dc.identifier.issnl0271-4655-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats