Kodo: An Open and Research Oriented Network Coding Library

Morten Videbæk Pedersen, Janus Heide, Frank Fitzek

Research output: Contribution to journalConference article in JournalResearchpeer-review

122 Citations (Scopus)
2332 Downloads (Pure)


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.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Pages (from-to)145-152
Number of pages8
Publication statusPublished - 13 May 2011
EventNetworking 2011, NC-Pro - Valencia, Spain
Duration: 13 May 201113 May 2011


WorkshopNetworking 2011, NC-Pro


Dive into the research topics of 'Kodo: An Open and Research Oriented Network Coding Library'. Together they form a unique fingerprint.

Cite this