Decoding Reed-Solomon codes up to the Sudan radius with the Euclidean algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Decoding Reed-Solomon codes up to the Sudan radius with the Euclidean algorithm

Abstract

We modify the Euclidean algorithm of Feng and Tzeng to decode Reed-Solomon (RS) codes up to the Sudan radius. The basic steps are the virtual extension to an Interleaved RS code and the reformulation of the multi-sequence shift-register problem of varying length to a multi-sequence problem of equal length. We prove the reformulation and analyze the complexity of our new decoding approach. Furthermore, the extended key equation, that describes the multi-sequence problem, is derived in an alternative polynomial way.
Fichier principal
Vignette du fichier
isita2010.pdf (330.06 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

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

Identifiers

Cite

Alexander Zeh, Wenhui Li. Decoding Reed-Solomon codes up to the Sudan radius with the Euclidean algorithm. IEEE International Symposium on Information Theory and its Applications (ISITA), Oct 2010, Taichung, Taiwan. pp.986-990, ⟨10.1109/ISITA.2010.5649520⟩. ⟨hal-00647597⟩
360 View
284 Download

Altmetric

Share

Gmail Facebook X LinkedIn More