CHARLES T. RETTER
Abstract
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.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: BCH code, Reed–Solomon error correction, Decoding methods, Berlekamp–Welch algorithm, Binary number, List decoding, Computer science, Binary code