This document introduces Reed-Solomon codes. It describes Reed-Solomon codes as word-oriented, non-binary BCH codes that are simple, robust, and perform well for burst errors. It explains that a Reed-Solomon code block length is N=2m-1, with a capacity to correct t errors using 2t parity check words. The document outlines the generator polynomial, encoding, decoding procedures including syndrome calculation, Berlekamp-Massey algorithm, Chien search, and Forney algorithm. It concludes with potential future tasks related to Reed-Solomon codes.