Network Coding in Minimal Multicast Networks

@article{Rouayheb2006NetworkCI,
  title={Network Coding in Minimal Multicast Networks},
  author={S. Y. el Rouayheb and C. N. Georghiades and Alexander Sprintson},
  journal={2006 IEEE Information Theory Workshop - ITW '06 Punta del Este},
  year={2006},
  pages={307-311}
}
We investigate the network coding problem in a certain class of minimal multicast networks. In a multicast coding network, a source S needs to deliver h symbols, or packets, to a set of destinations T over an underlying communication network modeled by a graph G. A coding network is said to be h-minimal if it can deliver h symbols from S to the destination nodes, while any proper subnetwork of G can deliver at most h — 1 symbols to the set of destination nodes. This problem is motivated by the… CONTINUE READING