Decoding binary expansions of low-rate Reed-Solomon codes far beyond the BCH bound
CHARLES T. RETTER · 2002
Binary expansions of low-rate Reed-Solomon codes typically are capable of correcting far more binary errors than guaranteed by the BCH bound on the Reed-Solomon code. Practical decoding algorithms that often correct beyond the true minimum distances of the binary codes are described.