Abstract : 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.
Vicente Casares-Giner; Pietro Manzoni; Ana Pont. International IFIP TC 6 Workshops PE-CRN, NC-Pro, WCNS, and SUNSET 2011 Held at NETWORKING 2011 (NETWORKING), May 2011, Valencia, Spain. Springer, Lecture Notes in Computer Science, LNCS-6827, pp.129-136, 2011, NETWORKING 2011 Workshops. 〈10.1007/978-3-642-23041-7_13〉
https://hal.inria.fr/hal-01587835
Contributeur : Hal Ifip
<>
Soumis le : jeudi 14 septembre 2017 - 16:48:08
Dernière modification le : mardi 24 avril 2018 - 16:16:53
Document(s) archivé(s) le : dimanche 17 décembre 2017 - 13:55:57
Janus Heide, Morten Pedersen, Frank Fitzek. Decoding Algorithms for Random Linear Network Codes. Vicente Casares-Giner; Pietro Manzoni; Ana Pont. International IFIP TC 6 Workshops PE-CRN, NC-Pro, WCNS, and SUNSET 2011 Held at NETWORKING 2011 (NETWORKING), May 2011, Valencia, Spain. Springer, Lecture Notes in Computer Science, LNCS-6827, pp.129-136, 2011, NETWORKING 2011 Workshops. 〈10.1007/978-3-642-23041-7_13〉. 〈hal-01587835〉
