Decoding Reed - Solomon codes beyond half the minimum distance using shift-register synthesis

Georg Schmidt, Vladimir Sidorenko, Martin Bossert

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

24 Citations (Scopus)

Abstract

It is known, that Interleaved Reed-Solomon codes can be decoded algebraically beyond half the minimum distance using collaborative decoding strategies. Based on the same principles, we suggest a new effective algebraic decoding method, which is able to decode a single low rate Reed-Solomon code beyond half the minimum distance. This new algorithm is based on multi-sequence shift-register synthesis, and is able to correct errors within a correcting radius similar to the Sudan algorithm. In contrast to the Sudan algorithm, which may obtain a list of codewords, our algorithm yields a decoding failure if there does not exist a unique solution. However, the probability of such a failure is very small.

Original languageEnglish
Title of host publicationProceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages459-463
Number of pages5
DOIs
Publication statusPublished - 2006
Externally publishedYes
Event2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States
Duration: 9 Jul 200614 Jul 2006

Publication series

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

Conference

Conference2006 IEEE International Symposium on Information Theory, ISIT 2006
Country/TerritoryUnited States
CitySeattle, WA
Period9/07/0614/07/06

Fingerprint

Dive into the research topics of 'Decoding Reed - Solomon codes beyond half the minimum distance using shift-register synthesis'. Together they form a unique fingerprint.

Cite this