Projekter pr. år
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.
Originalsprog | Engelsk |
---|---|
Bogserie | Lecture Notes in Computer Science |
Vol/bind | 6827 |
Sider (fra-til) | 145-152 |
Antal sider | 8 |
ISSN | 0302-9743 |
DOI | |
Status | Udgivet - 13 maj 2011 |
Begivenhed | Networking 2011, NC-Pro - Valencia, Spanien Varighed: 13 maj 2011 → 13 maj 2011 |
Workshop
Workshop | Networking 2011, NC-Pro |
---|---|
Land/Område | Spanien |
By | Valencia |
Periode | 13/05/2011 → 13/05/2011 |
Bibliografisk note
In Proceedings of the 2011 Networking Workshops. (eds.) Casares-Giner, Vincente, Manzoni, Pietro & Pont, Ana.Fingeraftryk
Dyk ned i forskningsemnerne om 'Kodo: An Open and Research Oriented Network Coding Library'. Sammen danner de et unikt fingeraftryk.Projekter
- 1 Afsluttet
-
CONE: Cooperation and Network Coding
Fitzek, F., Heide, J., Pedersen, M. V. & Larsen, T.
01/09/2009 → 31/07/2012
Projekter: Projekt › Forskning