Properties of Network Polynomials

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


Published in:
2012 Ieee International Symposium On Information Theory Proceedings (Isit)
Presented at:
IEEE International Symposium on Information Theory (ISIT'12), Cambridge, MA, USA, July 2-6, 2012
Year:
2012
Publisher:
New York, Ieee
ISBN:
978-1-4673-2579-0
Laboratories:




 Record created 2012-07-12, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)