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

https://hal.inria.fr/inria-00429680
Contributor : Kévin Huguenin <>
Submitted on : Thursday, March 14, 2013 - 3:34:08 PM
Last modification on : Thursday, January 7, 2021 - 4:35:58 PM
Long-term archiving on: : Saturday, June 15, 2013 - 2:30:08 AM

File

ltnc_short.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00429680, version 1

Citation

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⟩

Share

Metrics

Record views

530

Files downloads

171