Citation
Abstract
This article discusses the software implementation of a simplified algorithm for decoding errors and erasures of Reed-Solomon (R-S) code words using the techniques of finite field transforms and continued fractions. In particular, random code words from the (255, 223, 33) R-S code over GF(2® ) are corrupted by random error and erasure patterns, and decoded whenever theoretically possible. A matrix of execution times of this decoder under varying sets of errors and erasure patterns is also included. This matrix demonstrates the relative amounts of time required for decoding different error and erasure patterns, as well as the correctness of the algorithms and the software implementation.
Details
- Volume
- 42-53
- Published
- October 15, 1979
- Pages
- 102–107
- File Size
- 409.4 KB