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

75 Citations (Scopus)
2108 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)145-152
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
CountrySpain
CityValencia
Period13/05/201113/05/2011

Fingerprint

Network coding
Network Coding
Decoding
Galois field
Decode
Linear Codes
Gauss
Energy Consumption
Baseline
Throughput
Energy utilization
Coding
Binary
Libraries

Cite this

Pedersen, Morten Videbæk ; Heide, Janus ; Fitzek, Frank. / Kodo: An Open and Research Oriented Network Coding Library. In: Lecture Notes in Computer Science. 2011 ; Vol. 6827. pp. 145-152.
@inproceedings{1fc1d13c922a4f19b5826eaf67296029,
title = "Kodo: An Open and Research Oriented Network Coding Library",
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.",
author = "Pedersen, {Morten Videb{\ae}k} and Janus Heide and Frank Fitzek",
note = "In Proceedings of the 2011 Networking Workshops. (eds.) Casares-Giner, Vincente, Manzoni, Pietro & Pont, Ana.",
year = "2011",
month = "5",
day = "13",
doi = "10.1007/978-3-642-23041-7_15",
language = "English",
volume = "6827",
pages = "145--152",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Publishing Company",

}

Kodo: An Open and Research Oriented Network Coding Library. / Pedersen, Morten Videbæk; Heide, Janus; Fitzek, Frank.

In: Lecture Notes in Computer Science, Vol. 6827, 13.05.2011, p. 145-152.

Research output: Contribution to journalConference article in JournalResearchpeer-review

TY - GEN

T1 - Kodo: An Open and Research Oriented Network Coding Library

AU - Pedersen, Morten Videbæk

AU - Heide, Janus

AU - Fitzek, Frank

N1 - In Proceedings of the 2011 Networking Workshops. (eds.) Casares-Giner, Vincente, Manzoni, Pietro & Pont, Ana.

PY - 2011/5/13

Y1 - 2011/5/13

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-23041-7_15

DO - 10.1007/978-3-642-23041-7_15

M3 - Conference article in Journal

VL - 6827

SP - 145

EP - 152

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -