Transform decoding of Reed-Solomon codes over GF(2 to the 2n power using the techniques of Winograd

An algorithm for computing a Fourier-like transform over GF(2 to the (second power) to the n power), where n = 1,2,3,4,5, was developed to encode and decode and Reed-Solomon (RS) codes of length 2 to the (second power) to the n power. Such as RS detector is considerably faster than a decoder that uses the conventional fast transform over GF(2 to the (second power) to the n power).