Decoding punctured Reed-Solomon codes up to the Singleton bound

Vladimir Sidorenko, Georg Schmidt, Martin Bossert

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

13 Citations (Scopus)

Abstract

We show that punctured Reed-Solomon codes can be decoded virtually up to the Singleton bound with computational complexity quadratic in the code length using our algorithm [1, 2] based on multi-sequence shift-register synthesis. Our decoder may fail, but the probability of a decoding failure can be made negligibly small. We compare our results with the ones of Guruswami-Rudra [3], who considered list decoding of Folded Reed-Solomon codes up to their distance.

Original languageEnglish
Title of host publication7th International ITG Conference on Source and Channel Coding, SCC 2008
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9783800730773
Publication statusPublished - 2008
Externally publishedYes
Event7th International ITG Conference on Source and Channel Coding, SCC 2008 - Ulm, Germany
Duration: 14 Jan 200816 Jan 2008

Publication series

Name7th International ITG Conference on Source and Channel Coding, SCC 2008

Conference

Conference7th International ITG Conference on Source and Channel Coding, SCC 2008
Country/TerritoryGermany
CityUlm
Period14/01/0816/01/08

Fingerprint

Dive into the research topics of 'Decoding punctured Reed-Solomon codes up to the Singleton bound'. Together they form a unique fingerprint.

Cite this