Reed-Solomon codes represent non-binary systematic block-based error correcting codes related to the class of cyclic codes with numeric field different from GF(2) and representing a subset of Bose-Chaudhuri-Hocquenghem codes. The correcting capabilities of Reed-Solomon codes directly depend on the number of check bytes. Adding r check bytes allows you to detect r arbitrarily corrupted bytes and guarantees the restoration of r/2 bytes out of them.