Loading...
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.
Loading...
Name
isit2012-18.pdf
Access type
openaccess
Size
120.46 KB
Format
Adobe PDF
Checksum (MD5)
34e5a26032e65ae8fd7991cca03e33d4