Error and erasure correction of interleaved Reed-Solomon codes

Georg Schmidt, Vladimir R. Sidorenko, Martin Bossert

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Citations (Scopus)

Abstract

We present an algorithm for error and erasure correction of interleaved Reed-Solomon codes. Our algorithm is based on an algorithm recently proposed by Bleichenbacher et al. This algorithm is able to correct many error patterns beyond half the minimum distance of the interleaved Reed-Solomon code. We extend the algorithm in a way, that it is not only able to correct errors, but can correct both, errors and erasures simultaneously. Furthermore we present techniques to describe the algorithm in an efficient way. This can help to reduce the complexity when implementing the algorithm.

Original languageEnglish
Title of host publicationCoding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers
PublisherSpringer Verlag
Pages22-35
Number of pages14
ISBN (Print)3540354816, 9783540354819
DOIs
Publication statusPublished - 2006
Externally publishedYes
EventInternational Workshop on Coding and Cryptography, WCC 2005 - Bergen, Norway
Duration: 14 Mar 200518 Mar 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3969 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Workshop on Coding and Cryptography, WCC 2005
Country/TerritoryNorway
CityBergen
Period14/03/0518/03/05

Fingerprint

Dive into the research topics of 'Error and erasure correction of interleaved Reed-Solomon codes'. Together they form a unique fingerprint.

Cite this