Decoding Algorithms for Random Linear Network Codes
Publication: Research - peer-review › Conference article in Journal
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.
|Book series||Lecture Notes in Computer Science|
|Publication date||13 May 2011|
|Number of pages||8|
|Workshop||Networking 2011, NC-Pro|
|Period||13/05/11 → 13/05/11|
Loading map data...
No data available