2003Unpublished venueRequires access

BCH Codes—Nonbinary And Reed‐Solomon*

A.M. Michelson, Allen H. Levesque

Open publisher page 1 citations

Abstract

Abstract The description of nonbinary BCH codes closely follows the presentation for binary BCH codes in the preceding article. Nonbinary BCH codes are described as cyclic codes whose generator polynomials have particular sequences of roots. Reed Solomon codes are defined as nonbinary BCH codes whose symbol and locator fields are the same. Efficient encoding and decoding algorithms are described for hard‐decision and errors‐and‐erasures decoding. More general soft‐decision decoding schemes are discussed.

About this research paper

What this paper is about

Abstract The description of nonbinary BCH codes closely follows the presentation for binary BCH codes in the preceding article. Nonbinary BCH codes are described as cyclic codes whose generator polynomials have particular sequences of roots. Reed Solomon codes are defined as nonbinary BCH codes whose symbol and locator fields are the same. Efficient encoding and decoding algorithms are described for hard‐decision and errors‐and‐erasures decoding. More general soft‐decision decoding schemes are discussed.

Why it matters

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

Abstract The description of nonbinary BCH codes closely follows the presentation for binary BCH codes in the preceding article. Nonbinary BCH codes are described as cyclic codes whose generator polynomials have particular sequences of roots. Reed Solomon codes are defined as nonbinary BCH codes whose symbol and locator fields are the same. Efficient encoding and decoding algorithms are described for hard‐decision and errors‐and‐erasures decoding. More general soft‐decision decoding schemes are discussed.

Key concepts: BCH code, Reed–Solomon error correction, Berlekamp–Welch algorithm, Mathematics, Decoding methods, Linear code, Block code, Discrete mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
BCH Codes—Nonbinary And Reed‐Solomon* — Research Paper | ScholarLens