Citation
Abstract
Using the finite field transform and continued fractions, a simplified algorithm for decoding Reed-Solomon codes is developed to correct erasures caused by other codes as well as errors over the finite field GF(q™ ), where q is a prime and m is an integer. Such an R-S decoder can be faster and simpler than a decoder that uses more conventional methods.
Details
- Volume
- 42-48
- Published
- December 15, 1978
- Pages
- 66–71
- File Size
- 455.7 KB