It is well known that transfer polynomials play an important role in the network code design problem. In this talk we provide a graph theoretical description of the terms of such polynomials. We consider acyclic networks with one or two 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.
Javad B. Ebrahimi is a post-doctoral fellow at the Institute of Network Coding, CUHK. He received his B.Sc. and M.Sc. degrees in Pure Mathematics from Sharif University (2004) of Technology and Simon Fraser University (2008), respectively. In 2013, he received a PhD degree in Communication and Computer Sciences from EPFL, Switzerland.
His research interest includes algebraic and combinatorial aspects of information theory, Network Coding and Graph Theory.
