摘要: We consider the network communication scenario, over directed acyclic networks with unit capacity edges in which a number of sources si each holding independent unit-entropy information Xi wish to communicate sum ΣXi set terminals tj. show that case there are only two or terminals, is possible if and source terminal pair si/tj connected by at least single path. For more general problem three we prove path connecting pairs does not suffice ΣXi. then present an efficient encoding scheme enables for sources, case, given edge disjoint paths.