Multicasting algorithms for deterministic networks

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.