Coding for Network Coding

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.
12 pages, 2 ps figures

Keywords

Information Theory, Networking and Internet Architecture

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/142821

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0711.3935
 http://arxiv.org/abs/0711.3935

Collections

arXiv