Skip to Main content Skip to Navigation
Conference papers

LT Network Codes: Low Complexity Network Codes

Abstract : 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.
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Kévin Huguenin Connect in order to contact the contributor
Submitted on : Thursday, March 14, 2013 - 3:34:08 PM
Last modification on : Thursday, January 20, 2022 - 5:30:13 PM
Long-term archiving on: : Saturday, June 15, 2013 - 2:30:08 AM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads