Citation
Abstract
In this article, a combination of the Chinese Remainder Theorem and Winograd’s algorithm is used to compute transforms of odd length over GF(2™ ). Such transforms are used to compute the syndromes needed for decoding BCH and RS codes. The present scheme requires substantially fewer multiplications and additions than the conventional method of computing the syndromes directly.
Details
- Volume
- 42-52
- Published
- August 15, 1979
- Pages
- 67–70
- File Size
- 270.3 KB