Skip to main content
Springer Nature Link
Log in

A construction method of matroidal networks

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

This paper discusses the question whether a network-matroid construction can be modified so that all matroid dependencies are reflected in the network. We propose a novel construction method for a matroidal network to address this issue. Furthermore, we investigate some properties of the matroidal network based on our construction method. New relations between the matroidal network and its associated matroid are developed through various examples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Li R, Yeung S, Cai N. Linear network coding. IEEE Trans Inform Theory, 2003, 49: 371–381

    Article  MathSciNet  MATH  Google Scholar 

  2. Koetter R, Medard M. An algebraic approach to network coding. IEEE/ACM Trans Netw, 2003, 11: 782–795

    Article  Google Scholar 

  3. Ahlswede R, Cai N, Li S-Y R, et al. Network information flow. IEEE Trans Inf Theory, 2000, 46: 1204–1216

    Article  MathSciNet  MATH  Google Scholar 

  4. Zhang Z, Yeung R W. On characterization of entropy function via information inequalities. IEEE Trans Inform Theory, 1998, 44: 1440–1452

    Article  MathSciNet  MATH  Google Scholar 

  5. Cannons J, Dougherty R, Freiling C, et al. Network routing capacity. IEEE Trans Inform Theory, 2006, 52: 777–788

    Article  MathSciNet  Google Scholar 

  6. Dougherty R, Freiling C, Zeger K. Unachievability of network coding capacity. IEEE Trans Inf Theory, 2006, 52: 2365–2372

    Article  MathSciNet  Google Scholar 

  7. Yuan C, Kan H B. A characterization of solvability for a class of networks. Sci China Inf Sci. Forthcoming

  8. Dougherty R, Freiling C, Zeger K. Networks, matroids, and non-Shannon information inequalities. IEEE Trans Inform Theory, 2007, 53: 1949–1969

    Article  MathSciNet  Google Scholar 

  9. Welsh D J A. Matroid Theory. London: Academic, 1976

    MATH  Google Scholar 

  10. Dougherty R, Freiling C, Zeger K. Unachievability of network coding capacity. IEEE Trans Inform Theory, 2006, 52: 2365–2372

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Fudan University, Shanghai, 200433, China

    Chen Yuan, HaiBin Kan & Xin Wang

  2. Faculty of Science and Engineering, Chuo University Tokyo, Tokyo, 112-8551, Japan

    Hideki Imai

Authors
  1. Chen Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. HaiBin Kan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hideki Imai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to HaiBin Kan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yuan, C., Kan, H., Wang, X. et al. A construction method of matroidal networks. Sci. China Inf. Sci. 55, 2445–2453 (2012). https://doi.org/10.1007/s11432-011-4373-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-011-4373-x

Keywords

Search

Navigation