File Download
  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
KeywordsAcyclic directed networks
Edge-disjoint paths
Encoding complexity
Graph theoretical approach
Multiple pairs
Issue Date2012
PublisherIEEE. The Journal's web site is located at http://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 ISITA Proceedings, 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

 

DC FieldValueLanguage
dc.contributor.authorXu, ELen_US
dc.contributor.authorShang, Wen_US
dc.contributor.authorHan, Gen_US
dc.date.accessioned2012-08-16T06:07:18Z-
dc.date.available2012-08-16T06:07:18Z-
dc.date.issued2012en_US
dc.identifier.citationThe 2012 International Symposium on Information Theory and its Applications (ISITA), Honolulu, HI., 28-31 October 2012. In ISITA Proceedings, 2012, p. 396-400en_US
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.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1002712-
dc.relation.ispartofInternational Symposium on Information Theory and Its Applications Proceedingsen_US
dc.rightsInternational Symposium on Information Theory and Its Applications Proceedings. Copyright © IEEE.-
dc.rights©2012 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.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 complexityen_US
dc.typeConference_Paperen_US
dc.identifier.emailXu, EL: xuli@hku.hken_US
dc.identifier.emailShang, W: shangwp@zzu.edu.cn-
dc.identifier.emailHan, G: ghan@hku.hk-
dc.identifier.authorityHan, G=rp00702en_US
dc.description.naturepublished_or_final_version-
dc.identifier.scopuseid_2-s2.0-84873544213-
dc.identifier.hkuros204015en_US
dc.identifier.spage396-
dc.identifier.epage400-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 130321-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats