Citation
Abstract
Using a finite field transform, a transform decoding algorithm is able to correct erasures as well as errors of any (n, k, d) Reed-Solomon code over the finite field GF(q). This article discusses a pitfall of transform decoding and how to avoid it. A simple test is given so that the decoder will fail to decode instead of introducing additional errors, whenever the received word contains too many errors and erasures.
Details
- Volume
- 42-62
- Published
- April 15, 1981
- Pages
- 121–124
- File Size
- 190.7 KB