A link between Guruswami-Sudan's list-decoding and decoding of interleaved Reed-Solomon codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

A link between Guruswami-Sudan's list-decoding and decoding of interleaved Reed-Solomon codes

Abstract

The Welch-Berlekamp approach for Reed-Solomon (RS) codes forms a bridge between classical syndrome-based decoding algorithms and interpolation-based list-decoding procedures for list size ℓ = 1. It returns the univariate error-locator polynomial and the evaluation polynomial of the RS code as a y-root. In this paper, we show the connection between the Welch-Berlekamp approach for a specific Interleaved Reed-Solomon code scheme and the Guruswami-Sudan principle. It turns out that the decoding of Interleaved RS codes can be formulated as a modified Guruswami-Sudan problem with a specific multiplicity assignment. We show that our new approach results in the same solution space as the Welch-Berlekamp scheme. Furthermore, we prove some important properties.

Keywords

Fichier principal
Vignette du fichier
ISIT2010.pdf (155.29 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

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

Identifiers

Cite

Alexander Zeh, Christian Senger. A link between Guruswami-Sudan's list-decoding and decoding of interleaved Reed-Solomon codes. IEEE International Symposium on Information Theory (ISIT), Jun 2010, Austin, United States. pp.1198-1202, ⟨10.1109/ISIT.2010.5513427⟩. ⟨hal-00647609⟩
196 View
155 Download

Altmetric

Share

Gmail Facebook X LinkedIn More