Properties of Network Polynomials

• Publication date: 2012

It 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.

Keywords: Transfer polynomial ; network polynomial

Reference

• EPFL-REPORT-174732

Record created on 2012-02-04, modified on 2012-03-21