2008•IEEE Transactions on Information TheoryRequires access

New List Decoding Algorithms for Reed–Solomon and BCH Codes

Yingquan Wu

Open publisher page 89 citations

Abstract

In this paper, we devise a rational curve fitting algorithm and apply it to the list decoding of Reed-Solomon and Bose-Chaudhuri-Hocquenghen (BCH) codes. The resulting list decoding algorithms exhibit the following significant properties.

About this research paper

What this paper is about

In this paper, we devise a rational curve fitting algorithm and apply it to the list decoding of Reed-Solomon and Bose-Chaudhuri-Hocquenghen (BCH) codes. The resulting list decoding algorithms exhibit the following significant properties.

Why it matters

OpenAlex reports 89 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

In this paper, we devise a rational curve fitting algorithm and apply it to the list decoding of Reed-Solomon and Bose-Chaudhuri-Hocquenghen (BCH) codes. The resulting list decoding algorithms exhibit the following significant properties.

Key concepts: Berlekamp–Welch algorithm, BCH code, Decoding methods, Reed–Solomon error correction, List decoding, Algorithm, Computer science, Sequential decoding

Related papers

Back to paper searchBrowse research topicsOriginal source
New List Decoding Algorithms for Reed–Solomon and BCH Codes — Research Paper | ScholarLens