Citation
Abstract
In this article it is shown that Winograd’s methods can be modified to compute Fourier-like transforms over GF (2"), where n = 4,5,6,8. Such transforms are used to encode and decode Reed-Solomon codes of block length 2"-1. With these transforms a Reed-Solomon decoder can be made faster and more efficient than a decoder that uses the conventional fast transforms over GF(2" ).
Details
- Volume
- 42-50
- Published
- April 15, 1979
- Pages
- 132–155
- File Size
- 1.4 MB