Minimal Network Coding for Multicast

Simple item page
dc.creatorBhattad, Kapil
dc.creatorRatnakar, Niranjan
dc.creatorKoetter, Ralf
dc.creatorNarayanan, Krishna R.
dc.date2005-06-12
dc.date.accessioned2026-07-07T08:15:28Z
dc.date.available2026-07-07T08:15:28Z
dc.descriptionWe give an information flow interpretation for multicasting using network coding. This generalizes the fluid model used to represent flows to a single receiver. Using the generalized model, we present a decentralized algorithm to minimize the number of packets that undergo network coding. We also propose a decentralized algorithm to construct capacity achieving multicast codes when the processing at some nodes is restricted to routing. The proposed algorithms can be coupled with existing decentralized schemes to achieve minimum cost muticast.
dc.descriptionaccepted for publication at ISIT 2005
dc.identifierhttps://arxiv.org/abs/cs/0506044
dc.identifierhttp://arxiv.org/abs/cs/0506044
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133460
dc.subjectInformation Theory
dc.titleMinimal Network Coding for Multicast
dc.typetext

Files

Collections

arXiv