Coding for Network Coding

Simple item page
dc.creatorMontanari, Andrea
dc.creatorUrbanke, Ruediger
dc.date2007-11-26
dc.date.accessioned2026-07-07T08:44:54Z
dc.date.available2026-07-07T08:44:54Z
dc.descriptionWe consider communication over a noisy network under randomized linear network coding. Possible error mechanism include node- or link- failures, Byzantine behavior of nodes, or an over-estimate of the network min-cut. Building on the work of Koetter and Kschischang, we introduce a probabilistic model for errors. We compute the capacity of this channel and we define an error-correction scheme based on random sparse graphs and a low-complexity decoding algorithm. By optimizing over the code degree profile, we show that this construction achieves the channel capacity in complexity which is jointly quadratic in the number of coded information bits and sublogarithmic in the error probability.
dc.description12 pages, 2 ps figures
dc.identifierhttps://arxiv.org/abs/0711.3935
dc.identifierhttp://arxiv.org/abs/0711.3935
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142821
dc.subjectInformation Theory
dc.subjectNetworking and Internet Architecture
dc.titleCoding for Network Coding
dc.typetext

Files

Collections

arXiv