Guruswami-Sudan list decoding for complex reed-Solomon codes

Mostafa H. Mohamed, Sven Puchinger, Martin Bossert

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

Abstract

We analyze the Guruswami-Sudan list decoding algorithm for Reed-Solomon codes over the complex field for sparse recovery in Compressed Sensing. We propose methods of stabilizing both the interpolation and the root-finding steps against numerical instabilities, where the latter is the most sensitive. For this purpose, we modify the Roth-Ruckenstein algorithm and propose a method to refine its result using Newton's method. The overall decoding performance is then further improved using Generalized Minimum Distance decoding based on intrinsic soft information. This method also allows to obtain a unique solution of the recovery problem. The approach is numerically evaluated and shown to improve upon recently proposed decoding techniques.

Original languageEnglish
Title of host publicationSCC 2017 - 11th International ITG Conference on Systems, Communications and Coding
PublisherVDE VERLAG GMBH
ISBN (Electronic)9783800743629
StatePublished - 2019
Externally publishedYes
Event11th International ITG Conference on Systems, Communications and Coding, SCC 2017 - Hamburg, Germany
Duration: 6 Feb 20179 Feb 2017

Publication series

NameSCC 2017 - 11th International ITG Conference on Systems, Communications and Coding

Conference

Conference11th International ITG Conference on Systems, Communications and Coding, SCC 2017
Country/TerritoryGermany
CityHamburg
Period6/02/179/02/17

Fingerprint

Dive into the research topics of 'Guruswami-Sudan list decoding for complex reed-Solomon codes'. Together they form a unique fingerprint.

Cite this