Ebrahimi Boroojeni, JavadFragjouli, Christina2012-07-122012-07-122012-07-12201210.1109/ISIT.2012.6283068https://infoscience.epfl.ch/handle/20.500.14299/83792WOS:000312544301081It is well known that transfer polynomials play an important role in the network code design problem. In this paper we provide a graph theoretical description of the terms of such polynomials. We consider acyclic networks with arbitrary number of receivers and min-cut h between each source-receiver pair. We show that the associated polynomial can be described in terms of certain subgraphs of the network.text::conference output::conference proceedings::conference paper