File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ITW.2014.6970891
- Scopus: eid_2-s2.0-84929359236
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: On the Solvability of Three-Pair Networks With Common Bottleneck Links
Title | On the Solvability of Three-Pair Networks With Common Bottleneck Links |
---|---|
Authors | |
Keywords | A-set k-pair network Network coding |
Issue Date | 2014 |
Publisher | I 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? |
Abstract | We 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. |
Description | Session We2A: Network Coding II |
Persistent Identifier | http://hdl.handle.net/10722/204180 |
ISSN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cai, K | en_US |
dc.contributor.author | Han, G | - |
dc.date.accessioned | 2014-09-19T21:19:52Z | - |
dc.date.available | 2014-09-19T21:19:52Z | - |
dc.date.issued | 2014 | - |
dc.identifier.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 | en_US |
dc.identifier.issn | 1662-9019 | - |
dc.identifier.uri | http://hdl.handle.net/10722/204180 | - |
dc.description | Session We2A: Network Coding II | - |
dc.description.abstract | We 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.language | eng | en_US |
dc.publisher | I E E E. | - |
dc.relation.ispartof | I E E E International Information Theory Workshop | en_US |
dc.subject | A-set | - |
dc.subject | k-pair network | - |
dc.subject | Network coding | - |
dc.title | On the Solvability of Three-Pair Networks With Common Bottleneck Links | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Han, G: ghan@hku.hk | en_US |
dc.identifier.authority | Han, G=rp00702 | en_US |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ITW.2014.6970891 | - |
dc.identifier.scopus | eid_2-s2.0-84929359236 | - |
dc.identifier.hkuros | 239367 | en_US |
dc.identifier.spage | 546 | - |
dc.identifier.epage | 550 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 1662-9019 | - |