2005•Unpublished venueRequires access

BCH and Reed‐Solomon Codes: Designer Cyclic Codes

Todd K. Moon

Abstract

The prelims comprise: BCH Codes Reed-Solomon Codes Decoding BCH and RS Codes: The General Outline Finding the Error Locator Polynomial Non-Binary BCH and RS Decoding Euclidean Algorithm for the Error Locator Polynomial Erasure Decoding for Nonbinary BCH or RS codes Galois Field Fourier Transform Methods Variations and Extensions of Reed-Solomon Codes Appendix 6.A Proof of Newton's Identities Exercises References

About this research paper

What this paper is about

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

Key concepts: BCH code, Reed–Solomon error correction, Berlekamp–Welch algorithm, Mathematics, Polynomial code, Polynomial, Arithmetic, Finite field