DFT, convolution and error correcting codes

Blahut (1983) has introduced a new view of linear cyclic error correcting codes, based on familiar operations of signal processing, convolutions, Fourier transforms, and shift registers. Cyclic codes be described very naturally in the transform domain and many structural properties of this class of codes can also be investigated using familiar signal processing techniques. New results on bounding the minimum distance of cyclic codes and on error-and-erasure decoding of cyclic codes based on transform domain techniques are presented. Since there are many fast Fourier transform and convolution algorithms, this error and erasure decoding procedure can be efficiently implemented