File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: On uniform matroidal networks

TitleOn uniform matroidal networks
Authors
Issue Date2013
PublisherInstitute of Electrical and Electronics Engineers. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369
Citation
The 2013 IEEE International Symposium on Information Theory (ISIT), Istanbul, Turkey, 7 -12 July 2013. In The 2013 IEEE International Symposium on Information (ISIT) Theory Proceedings, 2013, p. 2730-2734 How to Cite?
AbstractMatroidal networks play a fundamental role in proving theoretical results on the limits of network coding. This can be explained by the underlying connections between network coding and matroid theory, both of which build upon the fundamental concept of independence. Two existing methods are known in the network coding literature for constructing networks from a matroid. The method due to Dougherty et al. [5] is high in time complexity but can create relatively simple network structures from a given matroid. Another method due to El Rouayheb et al. [3] is low in time complexity, but results in rather complex network structures. This work studies the design of matroidal networks from uniform matroids, targetting both low time complexity and minimum network sizes. Our construction is based on the new technique of dependence deduction, which may serve as a promising direction for constructing general matroidal networks. Some of our constructions lead to new networks for understanding network coding in terms of base field requirement.
Persistent Identifierhttp://hdl.handle.net/10722/186486
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorHe, Men_US
dc.contributor.authorLi, Zen_US
dc.contributor.authorWu, Cen_US
dc.date.accessioned2013-08-20T12:11:10Z-
dc.date.available2013-08-20T12:11:10Z-
dc.date.issued2013en_US
dc.identifier.citationThe 2013 IEEE International Symposium on Information Theory (ISIT), Istanbul, Turkey, 7 -12 July 2013. In The 2013 IEEE International Symposium on Information (ISIT) Theory Proceedings, 2013, p. 2730-2734en_US
dc.identifier.isbn9781479904464-
dc.identifier.issn2157-8095-
dc.identifier.urihttp://hdl.handle.net/10722/186486-
dc.description.abstractMatroidal networks play a fundamental role in proving theoretical results on the limits of network coding. This can be explained by the underlying connections between network coding and matroid theory, both of which build upon the fundamental concept of independence. Two existing methods are known in the network coding literature for constructing networks from a matroid. The method due to Dougherty et al. [5] is high in time complexity but can create relatively simple network structures from a given matroid. Another method due to El Rouayheb et al. [3] is low in time complexity, but results in rather complex network structures. This work studies the design of matroidal networks from uniform matroids, targetting both low time complexity and minimum network sizes. Our construction is based on the new technique of dependence deduction, which may serve as a promising direction for constructing general matroidal networks. Some of our constructions lead to new networks for understanding network coding in terms of base field requirement.-
dc.languageengen_US
dc.publisherInstitute of Electrical and Electronics Engineers. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369-
dc.relation.ispartofIEEE International Symposium on Information Theory. Proceedingsen_US
dc.rightsIEEE International Symposium on Information Theory. Proceedings. Copyright © Institute of Electrical and Electronics Engineers.-
dc.rights©2013 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.titleOn uniform matroidal networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailWu, C: cwu@cs.hku.hken_US
dc.identifier.authorityWu, C=rp01397en_US
dc.description.naturepublished_or_final_version-
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/ISIT.2013.6620723-
dc.identifier.scopuseid_2-s2.0-84890393721-
dc.identifier.hkuros217650en_US
dc.identifier.spage2730-
dc.identifier.epage2734-
dc.publisher.placeInstitute of Electrical and Electronics Engineers-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats