On Random Network Coding for Multicast

Simple item page
dc.creatorTauste-Campo, Adria
dc.creatorGrant, Alex
dc.date2007-02-09
dc.date.accessioned2026-07-07T08:17:03Z
dc.date.available2026-07-07T08:17:03Z
dc.descriptionRandom linear network coding is a particularly decentralized approach to the multicast problem. Use of random network codes introduces a non-zero probability however that some sinks will not be able to successfully decode the required sources. One of the main theoretical motivations for random network codes stems from the lower bound on the probability of successful decoding reported by Ho et. al. (2003). This result demonstrates that all sinks in a linearly solvable network can successfully decode all sources provided that the random code field size is large enough. This paper develops a new bound on the probability of successful decoding.
dc.description5 pages, 4 figures. Submitted to 2007 IEEE International Symposium on Information Theory
dc.identifierhttps://arxiv.org/abs/cs/0702052
dc.identifierhttp://arxiv.org/abs/cs/0702052
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133994
dc.subjectInformation Theory
dc.titleOn Random Network Coding for Multicast
dc.typetext

Files

Collections

arXiv