Unambiguous Decoding of Generalized Reed–Solomon Codes Beyond Half the Minimum Distance - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Unambiguous Decoding of Generalized Reed–Solomon Codes Beyond Half the Minimum Distance

Résumé

The Schmidt–Sidorenko–Bossert scheme extends a low-rate Reed–Solomon code to an Interleaved Reed–Solomon code and achieves the decoding radius of Sudan’s original list decoding algorithm while the decoding result remains unambiguous. We adapt this result to the case of Generalized Reed–Solomon codes and calculate the parameters of the corresponding Interleaved Generalized Reed–Solomon code. Furthermore, the failure probability is derived.
Fichier non déposé

Dates et versions

hal-01120389 , version 1 (25-02-2015)

Identifiants

Citer

Alexander Zeh, Antonia Wachter-Zeh, Martin Bossert. Unambiguous Decoding of Generalized Reed–Solomon Codes Beyond Half the Minimum Distance. International Zurich Seminar on Communications, Feb 2012, Zurich, Switzerland. ⟨10.3929/ethz-a-007052646⟩. ⟨hal-01120389⟩
250 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More