Decoding binary expansions of low-rate Reed-Solomon codes farbeyond the BCH bound

摘要

Binary expansions of low-rate Reed-Solomon codes typically arecapable of correcting far more binary errors than guaranteed by the BCHbound on the Reed-Solomon code. Practical decoding algorithms that oftencorrect beyond the true minimum distances of the binary codes aredescribed