BCH Codes—Nonbinary And Reed‐Solomon*
A.M. Michelson, Allen H. Levesque
Abstract
A.M. Michelson, Allen H. Levesque
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.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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