A characterization of solvability for a class of networks

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.

[1]  Randall Dougherty,et al.  Unachievability of network coding capacity , 2006, IEEE Transactions on Information Theory.

[2]  Randall Dougherty,et al.  Insufficiency of linear coding in network information flow , 2005, IEEE Transactions on Information Theory.

[3]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[4]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[5]  Randall Dougherty,et al.  Linearity and solvability in multicast networks , 2004, IEEE Transactions on Information Theory.

[6]  April Rasala Lehman,et al.  Complexity classification of network information flow problems , 2004, SODA '04.