This article is a tutorial discussion of the Guruswami–Sudan (GS) Reed–Solomon decoding
algorithm, including self-contained treatments of the Kötter and Roth–Ruckenstein (RR) …

Error-correcting codes are ubiquitous. They are adopted in almost every modern digital
communication and storage system, such as wireless communications, optical …

In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon
(RS) codes offering both complexity and performance advantages over previously known …

The main computational steps in algebraic soft decoding, as well as Sudan-type list
decoding, of Reed-Solomon codes are interpolation and factorization. A series of …

The performance of algebraic soft-decision decoding of Reed-Solomon codes using bit-level
soft information is investigated. Optimal multiplicity assignment strategies for algebraic soft …

Efficient soft-decision decoding of Reed-Solomon (RS) codes is made possible by the
Koetter-Vardy (KV) algorithm which consists of a front-end to the interpolation-based …

An algebraic soft-decision decoder for Hermitian codes is presented. We apply Koetter and
Vardy's soft-decision decoding framework, now well established for Reed-Solmon codes, to …

Algebraic soft-decision decoding of Reed-Solomon (RS) codes delivers promising coding
gains over conventional hard-decision decoding. The most computationally demanding step …

Algebraic soft-decision decoding of Reed-Solomon codes is a promising technique for
exploiting reliability information in the decoding process. While the algorithmic aspects of the …

This dissertation is concerned with algebraic list-decoding of error-correcting codes. During
the past decade, significant advances in this are were achieved. The breakthrough papers of …