Error correction capabilities of binary mapped Reed-Solomon codes with parity bits appended to all symbols

It is shown that the class of binary codes obtained from an RS code over GF(2^m) with a parity bit appended to each RS-code symbol in GF(2^m) can be decoded very efficiently by an RS decoding algorithm which corrects both errors and erasures. The error correction capabilities of this-modified class of codes are discussed. It turns out that some subcodes of this class are competitive with the best-known quadratic-residue codes with similar parameters. Also this class of codes inherits the burst error correction capability from the original RS code