Projects per year
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 onthefly version of the GaussJordan 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 1020% on average depending on the code parameters.
Original language  English 

Book series  Lecture Notes in Computer Science 
Volume  6827 
Pages (fromto)  145152 
Number of pages  8 
ISSN  03029743 
DOIs  
Publication status  Published  13 May 2011 
Event  Networking 2011, NCPro  Valencia, Spain Duration: 13 May 2011 → 13 May 2011 
Workshop
Workshop  Networking 2011, NCPro 

Country/Territory  Spain 
City  Valencia 
Period  13/05/2011 → 13/05/2011 
Fingerprint
Dive into the research topics of 'Kodo: An Open and Research Oriented Network Coding Library'. Together they form a unique fingerprint.Projects
 1 Finished

CONE: Cooperation and Network Coding
Fitzek, F., Heide, J., Pedersen, M. V. & Larsen, T.
01/09/2009 → 31/07/2012
Project: Research