2003•Unpublished venueRequires access

Adaptive Reed-Solomon decoding using Gao's algorithm

J.J. Komo, L.L. Joiner

Abstract

Gao's algorithm for decoding Reed-Solomon codes is considered here. This algorithm is a new algorithm that computes the message polynomial estimate directly without explicitly finding error locations or error magnitudes. A generalized-minimum-distance (GMD) decoding procedure is used in conjunction with Gao's algorithm for efficiently decoding Reed-Solomon codes. It is shown here that the decoder polynomial only has to be slightly modified as the number of erasures is increased for each step of the generalized-minimum-distance decoding.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Berlekamp–Welch algorithm, Decoding methods, List decoding, Reed–Solomon error correction, Sequential decoding, Algorithm, Error detection and correction, Polynomial