File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/Allerton.2011.6120340
- Scopus: eid_2-s2.0-84862959508
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Bounds and exact values in network encoding complexity with two sinks
Title | Bounds and exact values in network encoding complexity with two sinks |
---|---|
Authors | |
Issue Date | 2011 |
Publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6111659 |
Citation | The 49th Allerton Conference on Communication, Control and Computing, Monticello, Illinois, USA, 28-30 September 2011. In Annual Allerton Conference on Communication, Control and Computing Proceedings, 2011, p. 1462-1469 How to Cite? |
Abstract | For an acyclic directed network with multiple pairs of sources and sinks and a set of Menger's paths connecting each pair of source and sink, it is well known that the number of mergings among these Menger's paths is closely related to network encoding complexity. In this paper, we focus on networks with two distinct sinks and we derive bounds on and exact values of two functions relevant to encoding complexity for such networks. © 2011 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/158882 |
ISBN | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Xu, L | en_US |
dc.contributor.author | Han, G | en_US |
dc.date.accessioned | 2012-08-08T09:04:05Z | - |
dc.date.available | 2012-08-08T09:04:05Z | - |
dc.date.issued | 2011 | en_US |
dc.identifier.citation | The 49th Allerton Conference on Communication, Control and Computing, Monticello, Illinois, USA, 28-30 September 2011. In Annual Allerton Conference on Communication, Control and Computing Proceedings, 2011, p. 1462-1469 | en_US |
dc.identifier.isbn | 9781457718175 | - |
dc.identifier.uri | http://hdl.handle.net/10722/158882 | - |
dc.description.abstract | For an acyclic directed network with multiple pairs of sources and sinks and a set of Menger's paths connecting each pair of source and sink, it is well known that the number of mergings among these Menger's paths is closely related to network encoding complexity. In this paper, we focus on networks with two distinct sinks and we derive bounds on and exact values of two functions relevant to encoding complexity for such networks. © 2011 IEEE. | en_US |
dc.language | eng | en_US |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6111659 | - |
dc.relation.ispartof | Annual Allerton Conference on Communication, Control and Computing Proceedings | en_US |
dc.title | Bounds and exact values in network encoding complexity with two sinks | 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 | en_US |
dc.identifier.doi | 10.1109/Allerton.2011.6120340 | en_US |
dc.identifier.scopus | eid_2-s2.0-84862959508 | en_US |
dc.identifier.hkuros | 201666 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-84856081386&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.spage | 1462 | en_US |
dc.identifier.epage | 1469 | en_US |
dc.publisher.place | United States | - |
dc.identifier.scopusauthorid | Xu, L=54911316000 | en_US |
dc.identifier.scopusauthorid | Han, G=8640067800 | en_US |