1981•IEEE Transactions on Information TheoryRequires access

High-speed decoding of BCH codes (Corresp.)

Chin-Long Chen

Abstract

A general algorithm is derived for the calculation of the error location polynomial in decoding a Bose-Chaudhuri-Hocquenguem (BCH) code. A shorter decoding time is required by the algorithm for low-weight errors because only a subset of the syndrome equations are to be satisfied. The application of the general algorithm to Berlekamp's algorithm is also presented.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 34 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: BCH code, Berlekamp–Welch algorithm, Decoding methods, Algorithm, List decoding, Polynomial, Sequential decoding, Computer science