Fast transform decoding of nonsystematic Reed-Solomon codes

摘要

By considering a Reed-Solomon (RS) code to be a special case of a redundant residue polynomial code, a fast transform decoding algorithm to correct both errors and erasures is presented. This decoding scheme is an improvement of the decoding algorithm for the redundant residue polynomial code suggested by Shiozaki and Nishida (1975). This decoding scheme can be realised readily on VLSI chips.