Skip to main content
SpringerLink
Log in

A characterization of solvability for a class of networks

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

Abstract

In this paper, we find that Property P can be generalized to characterize the solvability of a kind of networks with any number of sources, thus partially answering the open problem as to whether there are properties similar to Property P to characterize the solvability of some networks. As an application, for a given integer n, we construct such a solvable network that has no solvable solution if its alphabet size is less than n.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Lehman A R, Lehman E. Complexity classification of network information flow problems. In: The 41st Annual Allerton Conference on Communication Control and Computing, Monticello, Illinois, 2003

  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. Dougherty R, Freiling C, Zeger K. Linearity and solvability in multicast networks. IEEE Trans Inf Theory, 2004, 50: 2243–2256

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. Dougherty R, Freiling C, Zeger K. Insufficiency of linear coding in network information flow. IEEE Trans Inf Theory, 2005, 51: 2745–2759

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shanghai Key Lab of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, 200433, China

    Chen Yuan & HaiBin Kan

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

Corresponding author

Correspondence to HaiBin Kan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yuan, C., Kan, H. A characterization of solvability for a class of networks. Sci. China Inf. Sci. 55, 747–754 (2012). https://doi.org/10.1007/s11432-011-4461-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-011-4461-y

Keywords

Search

Navigation