Citation
Abstract
It is shown that Winograd’s algorithm can be used to compute an integer transform over GF(q), where q is a Mersenne prime. This new algorithm requires fewer multiplications than the conventional fast Fourier transform (FFT). This transform over GF(q) can be implemented readily on a digital computer. This fact makes it possible to more easily encode and decode BCH and RS codes.
Details
- Volume
- 42-41
- Published
- October 15, 1977
- Pages
- 176–205
- File Size
- 1.4 MB