Linked from

The 12 pages that link to Reed–Solomon code, each with the reason it gives.

• Finite fieldRelated: Its symbols and polynomial evaluations are computed in a finite field.

• Error-correcting codeBroader topic: It corrects symbol errors and underlies many storage and communication systems.

• Field (mathematics)Broader topic: Its encoding and recovery procedures use finite-field polynomial arithmetic.

• Coding theoryBroader topic: Its symbol-level redundancy corrects bursts of errors in storage and communication.

• Error detection and correctionBroader topic: Its symbol-level correction handles bursts that may damage several adjacent bits.

• Low-density parity-check codeCompared with: It corrects burst errors effectively but usually lacks LDPC’s iterative sparse-graph decoding.

• Hamming codeCompared with: It handles symbol-level corruption and burst errors beyond ordinary Hamming codes’ scope.

• Gilbert–Varshamov boundCompared with: Its explicit parameters show that structured codes can attain strong distance guarantees in suitable regimes.

• Singleton boundBroader topic: Its parameters attain the Singleton bound when the evaluation points are distinct.

• Elwyn BerlekampRelated: Berlekamp’s decoding techniques helped make these codes practical for correcting burst errors.

• Reed–Solomon error correctionBroader topic: This code construction supplies the redundancy that the correction method decodes.

• Information and communication theoryBroader topic: It corrects symbol errors in storage and communication systems, including optical media.