Citation
Abstract
This article considers a Reed-Solomon (RS) code to be a special case of a redundant residue polynomial (RRP) code, and presents a fast transform decoding algorithm to correct both errors and erasures. This decoding scheme is an improvement of the decoding algorithm for the RRP code suggested by Shiozaki and Nishida [1], and can be realized readily on VLSI chips.
Details
- Volume
- 42-99
- Published
- November 15, 1989
- Pages
- 130–140
- File Size
- 432.7 KB