DocumentCode
3113627
Title
Properties of network polynomials
Author
Ebrahimi, Javad B. ; Fragouli, Christina
Author_Institution
Sch. of Comput. & Commun. Sci, EPFL, Lausanne, Switzerland
fYear
2012
fDate
1-6 July 2012
Firstpage
1306
Lastpage
1310
Abstract
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
network coding; polynomials; acyclic networks; arbitrary number; graph theoretical description; min-cut h; network code design problem; network polynomials properties; source-receiver pair; transfer polynomials; Computers; Educational institutions; Electronic mail; Network coding; Polynomials; Receivers; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location
Cambridge, MA
ISSN
2157-8095
Print_ISBN
978-1-4673-2580-6
Electronic_ISBN
2157-8095
Type
conf
DOI
10.1109/ISIT.2012.6283068
Filename
6283068
Link To Document