Decoding Algorithms for Random Linear Network Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Decoding Algorithms for Random Linear Network Codes


We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially achieve a high coding throughput, and reduce energy consumption. We use an on-the-fly version of the Gauss-Jordan algorithm as a baseline, and provide several simple improvements to reduce the number of operations needed to perform decoding. Our tests show that the improvements can reduce the number of operations used during decoding with 10-20% on average depending on the code parameters.
Fichier principal
Vignette du fichier
978-3-642-23041-7_13_Chapter.pdf (130.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01587835 , version 1 (14-09-2017)





Janus Heide, Morten V. Pedersen, Frank Fitzek. Decoding Algorithms for Random Linear Network Codes. International IFIP TC 6 Workshops PE-CRN, NC-Pro, WCNS, and SUNSET 2011 Held at NETWORKING 2011 (NETWORKING), May 2011, Valencia, Spain. pp.129-136, ⟨10.1007/978-3-642-23041-7_13⟩. ⟨hal-01587835⟩
23 View
62 Download



Gmail Facebook X LinkedIn More