Efficient List-Decoding of Reed-Solomon Codes with the Fundamental Iterative Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Efficient List-Decoding of Reed-Solomon Codes with the Fundamental Iterative Algorithm

Abstract

In this paper we propose a new algorithm that solves the Guruswami-Sudan interpolation step for Reed-Solomon codes efficiently. It is a generalization of the Feng-Tzeng approach, the so-called fundamental iterative algorithm. From the interpolation constraints of the Guruswami-Sudan principle it is well known that an improvement of the decoding radius can only be achieved, if the multiplicity parameter s is smaller than the list size l. The code length is n and our proposed algorithm has a complexity (without asymptotic assumptions) of O(ls4 n2).}, keywords={Feng-Tzeng approach;Guruswami-Sudan interpolation;Reed-Solomon codes;communication complexity;efficient list-decoding;fundamental iterative algorithm;Reed-Solomon codes;communication complexity;decoding;iterative methods;
Fichier principal
Vignette du fichier
itw2009.pdf (196.45 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00647592 , version 1 (02-12-2011)

Identifiers

Cite

Alexander Zeh, Christian Gentner, Martin Bossert. Efficient List-Decoding of Reed-Solomon Codes with the Fundamental Iterative Algorithm. IEEE Information Theory Workshop (ITW), Sep 2010, Taorminia, Italy. pp.130-134, ⟨10.1109/ITW.2009.5351241⟩. ⟨hal-00647592⟩
336 View
178 Download

Altmetric

Share

Gmail Facebook X LinkedIn More