File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: On the Solvability of Three-Pair Networks With Common Bottleneck Links

TitleOn the Solvability of Three-Pair Networks With Common Bottleneck Links
Authors
Issue Date2014
PublisherI E E E.
Citation
The IEEE Information Theory Workshop (ITW 2014), Hobart, Australia, 2-5 November 2014. In the Proceedings of the I E E E International Information Theory Workshop, 2014, p. 546-550 How to Cite?
AbstractWe consider the solvability problem under network coding and derive a sufficient and necessary condition for 3-pair networks with common “bottleneck links” being solvable. We show that, for such networks: (1) the solvability can be determined in polynomial time; (2) being solvable is equivalent to being linear solvable; (3) finite fields of size 2 or 3 are sufficient to construct linear solutions.
DescriptionSession We2A: Network Coding II
Persistent Identifierhttp://hdl.handle.net/10722/204180
ISSN

 

DC FieldValueLanguage
dc.contributor.authorCai, Ken_US
dc.contributor.authorHan, G-
dc.date.accessioned2014-09-19T21:19:52Z-
dc.date.available2014-09-19T21:19:52Z-
dc.date.issued2014-
dc.identifier.citationThe IEEE Information Theory Workshop (ITW 2014), Hobart, Australia, 2-5 November 2014. In the Proceedings of the I E E E International Information Theory Workshop, 2014, p. 546-550en_US
dc.identifier.issn1662-9019-
dc.identifier.urihttp://hdl.handle.net/10722/204180-
dc.descriptionSession We2A: Network Coding II-
dc.description.abstractWe consider the solvability problem under network coding and derive a sufficient and necessary condition for 3-pair networks with common “bottleneck links” being solvable. We show that, for such networks: (1) the solvability can be determined in polynomial time; (2) being solvable is equivalent to being linear solvable; (3) finite fields of size 2 or 3 are sufficient to construct linear solutions.en_US
dc.languageengen_US
dc.publisherI E E E.-
dc.relation.ispartofI E E E International Information Theory Workshopen_US
dc.rightsI E E E International Information Theory Workshop. Copyright © I E E E.-
dc.rights©2014 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleOn the Solvability of Three-Pair Networks With Common Bottleneck Linksen_US
dc.typeConference_Paperen_US
dc.identifier.emailHan, G: ghan@hku.hken_US
dc.identifier.authorityHan, G=rp00702en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/ITW.2014.6970891-
dc.identifier.hkuros239367en_US
dc.identifier.spage546-
dc.identifier.epage550-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats