File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A graph theoretical approach to network encoding complexity

TitleA graph theoretical approach to network encoding complexity
Authors
Xu, ELShang, WHan, G
KeywordsAcyclic directed networks
Edge-disjoint paths
Encoding complexity
Graph theoretical approach
Multiple pairs
Issue Date2012
PublisherIEEE. The Journal's web site is located at https://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1002712
Citation
The 2012 International Symposium on Information Theory and its Applications (ISITA), Honolulu, HI., 28-31 October 2012. In 2012 International Symposium on Information Theory and its Applications, 2012, p. 396-400 How to Cite?
AbstractFor an acyclic directed network with multiple pairs of sources and sinks and a group of edge-disjoint paths connecting each pair of source and sink, it is known that the number of mergings among different groups of edge-disjoint paths is closely related to network encoding complexity. Using this connection, we derive exact values of and bounds on two functions relevant to encoding complexity for such networks. © 2012 IEICE Institute of Electronics Informati.
Persistent Identifierhttp://hdl.handle.net/10722/160280
ISBN
978-4-88552-267-3
ISI Accession Number ID
WOS:000320850700083

 

DC FieldValueLanguage
dc.contributor.authorXu, EL-
dc.contributor.authorShang, W-
dc.contributor.authorHan, G-
dc.date.accessioned2012-08-16T06:07:18Z-
dc.date.available2012-08-16T06:07:18Z-
dc.date.issued2012-
dc.identifier.citationThe 2012 International Symposium on Information Theory and its Applications (ISITA), Honolulu, HI., 28-31 October 2012. In 2012 International Symposium on Information Theory and its Applications, 2012, p. 396-400-
dc.identifier.isbn978-4-88552-267-3-
dc.identifier.urihttp://hdl.handle.net/10722/160280-
dc.description.abstractFor an acyclic directed network with multiple pairs of sources and sinks and a group of edge-disjoint paths connecting each pair of source and sink, it is known that the number of mergings among different groups of edge-disjoint paths is closely related to network encoding complexity. Using this connection, we derive exact values of and bounds on two functions relevant to encoding complexity for such networks. © 2012 IEICE Institute of Electronics Informati.-
dc.languageeng-
dc.publisherIEEE. The Journal's web site is located at https://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1002712-
dc.relation.ispartof2012 International Symposium on Information Theory and its Applications-
dc.rights2012 International Symposium on Information Theory and its Applications. Copyright © IEEE.-
dc.subjectAcyclic directed networks-
dc.subjectEdge-disjoint paths-
dc.subjectEncoding complexity-
dc.subjectGraph theoretical approach-
dc.subjectMultiple pairs-
dc.titleA graph theoretical approach to network encoding complexity-
dc.typeConference_Paper-
dc.identifier.emailXu, EL: xuli@hku.hk-
dc.identifier.emailShang, W: shangwp@zzu.edu.cn-
dc.identifier.emailHan, G: ghan@hku.hk-
dc.identifier.authorityHan, G=rp00702-
dc.identifier.scopuseid_2-s2.0-84873544213-
dc.identifier.hkuros204015-
dc.identifier.spage396-
dc.identifier.epage400-
dc.identifier.isiWOS:000320850700083-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 130321-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats