Multicasting algorithms for deterministic networks

  title={Multicasting algorithms for deterministic networks},
  author={J. B. Ebrahimi and Christina Fragouli},
  journal={2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo)},
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… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS
13 Citations
14 References
Similar Papers

Similar Papers

Loading similar papers…