Title :
Multicasting algorithms for deterministic networks
Author :
Ebrahimi, Javad ; Fragouli, Christina
Author_Institution :
Sch. of Comput. & Commun. Sci., Ecole Polytech. Fed. de Lausanne, Lausanne, Switzerland
Abstract :
We present a polynomial time algorithm for multicasting rate h to N receivers over deterministic networks. Our algorithm requires intermediate network nodes to perform coding operations over vectors of a finite length L, through multiplication with L × L binary coding matrices that play the same role as coding coefficients over graphs. Our code design consists in selecting these matrices so that each receiver is able to recover the source information. As a special case, we provide an alternative construction for a unicast algorithm over deterministic networks.
Keywords :
binary codes; multicast communication; radio receivers; binary coding matrices; code design; coding coefficients; coding operations; deterministic networks; intermediate network; multicasting algorithms; polynomial time algorithm; unicast algorithm; Binary codes; Computer networks; Context modeling; Galois fields; Java; Multicast algorithms; Network coding; Polynomials; Unicast; Wireless networks;
Conference_Titel :
Information Theory (ITW 2010, Cairo), 2010 IEEE Information Theory Workshop on
Conference_Location :
Cairo
Print_ISBN :
978-1-4244-6372-5
DOI :
10.1109/ITWKSPS.2010.5503221
