Decoding Algorithms for Random Linear Network Codes

Janus Heide, Morten Videbæk Pedersen, Frank Fitzek

Research output: Contribution to journalConference article in JournalResearchpeer-review

15 Citations (Scopus)
907 Downloads (Pure)

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

Workshop

WorkshopNetworking 2011, NC-Pro
Country/TerritorySpain
CityValencia
Period13/05/201113/05/2011

Fingerprint

Dive into the research topics of 'Decoding Algorithms for Random Linear Network Codes'. Together they form a unique fingerprint.
  • ENOC: Evolved Network COding

    Heide, J., Pedersen, M. V., Fitzek, F., Vingelmann, P. & Zhang, Q.

    01/09/200931/12/2010

    Project: Research

  • CONE: Cooperation and Network Coding

    Fitzek, F., Heide, J., Pedersen, M. V. & Larsen, T.

    FTP

    01/09/200931/07/2012

    Project: Research

Cite this