Skip to Main content Skip to Navigation
Conference papers

Decoding Algorithms for Random Linear Network Codes

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

https://hal.inria.fr/hal-01587835
Contributor : Hal Ifip <>
Submitted on : Thursday, September 14, 2017 - 4:48:08 PM
Last modification on : Tuesday, April 24, 2018 - 4:16:53 PM
Long-term archiving on: : Sunday, December 17, 2017 - 1:55:57 PM

File

978-3-642-23041-7_13_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Janus Heide, Morten 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⟩

Share

Metrics

Record views

92

Files downloads

211