File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Bounds and exact values in network encoding complexity with two sinks

TitleBounds and exact values in network encoding complexity with two sinks
Authors
Xu, LHan, G
Issue Date2011
PublisherIEEE. 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?
DOI: http://dx.doi.org/10.1109/Allerton.2011.6120340
AbstractFor 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 Identifierhttp://hdl.handle.net/10722/158882
ISBN
9781457718175
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorXu, Len_US
dc.contributor.authorHan, Gen_US
dc.date.accessioned2012-08-08T09:04:05Z-
dc.date.available2012-08-08T09:04:05Z-
dc.date.issued2011en_US
dc.identifier.citationThe 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-1469en_US
dc.identifier.isbn9781457718175-
dc.identifier.urihttp://hdl.handle.net/10722/158882-
dc.description.abstractFor 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.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6111659-
dc.relation.ispartofAnnual Allerton Conference on Communication, Control and Computing Proceedingsen_US
dc.titleBounds and exact values in network encoding complexity with two sinksen_US
dc.typeConference_Paperen_US
dc.identifier.emailHan, G:ghan@hku.hken_US
dc.identifier.authorityHan, G=rp00702en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/Allerton.2011.6120340en_US
dc.identifier.scopuseid_2-s2.0-84862959508en_US
dc.identifier.hkuros201666-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84856081386&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage1462en_US
dc.identifier.epage1469en_US
dc.publisher.placeUnited States-
dc.identifier.scopusauthoridXu, L=54911316000en_US
dc.identifier.scopusauthoridHan, G=8640067800en_US

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats