Reed-Solomon
A block error-correcting code over finite fields that can recover from multiple symbol errors or erasures and is widely used in storage and communications.
Information-Theory Context
Reed-Solomon codes operate on symbols over a finite field and can recover from multiple symbol errors or a larger number of known erasures. They have been used in optical media, QR codes, storage, and communication systems because burst corruption can often be represented as a limited number of symbol errors.
Coding Boundary
Reed-Solomon is not simple bit parity. Encoding and decoding operate on polynomials and symbols in a finite field such as GF(2^m), and the correction capability depends on the amount of parity redundancy.
Related Information-Theory Concepts
- Error-Correcting Code
- Erasure
- Finite Field
- CRC