LT Network Codes: Low Complexity Network Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

LT Network Codes: Low Complexity Network Codes


This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast belief propagation decoding instead of high complexity Gauss reduction used by random linear network coding (RLNC). In the context of a peer-to-peer content dissemination application, we observe that LTNC trades advantageously communication optimality of RLNC with decoding cost as it incurs only 38.5% of bandwidth overhead for a gain of almost 99% in CPU cycles.
Fichier principal
Vignette du fichier
ltnc_short.pdf (79.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00429680 , version 1 (14-03-2013)


  • HAL Id : inria-00429680 , version 1


Mary-Luc Champel, Kévin Huguenin, Anne-Marie Kermarrec, Nicolas Le Scouarnec. LT Network Codes: Low Complexity Network Codes. 5th ACM International Conference on emerging Networking EXperiments and Technologies (CoNeXT), Student Workshop, Dec 2009, Rome, Italy. ⟨inria-00429680⟩
234 View
106 Download


Gmail Facebook X LinkedIn More