Enhancing the correcting radius of Interleaved Reed-Solomon decoding using syndrome extension techniques

Georg Schmidt, Vladimir Sidorenko, Martin Bossert

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

10 Citations (Scopus)

Abstract

Reed-Solomon codes have become one of the most popular classes of error correcting codes, since they can be decoded very efficiently up to half their minimum distance using syndrome-based techniques. Modern interpolation-based decoding algorithms like the Sudan algorithm allow for decoding error patterns beyond half the minimum distance in polynomial time. Recently, a syndrome-based decoding algorithm has been proposed, which virtually extends a Reed-Solomon code into an Interleaved Reed-Solomon (IRS) code. This method is competitive to the classical Sudan algorithm. In this paper, a new method for decoding IRS codes is described, which combines the idea of syndrome extension and the idea of collaboratively decoding IRS codes to increase the decoding radius of low-rate IRS codes.

Original languageEnglish
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages1341-1345
Number of pages5
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: 24 Jun 200729 Jun 2007

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2007 IEEE International Symposium on Information Theory, ISIT 2007
Country/TerritoryFrance
CityNice
Period24/06/0729/06/07

Fingerprint

Dive into the research topics of 'Enhancing the correcting radius of Interleaved Reed-Solomon decoding using syndrome extension techniques'. Together they form a unique fingerprint.

Cite this