You seem to have answered your own question! For any set of `n + 1` sample values for degree-at-most-`n` polynomials, there's a map from the coefficient representation to the pointwise representation (obvious), and one going the other way (Lagrange interpolation). The DFT is just one instance of this, but a particularly nice one, because the map is essentially involutive, and subject to considerable computational speed-up.
What dots do you want to connect? (Anyway you can connect them with a high-degree polynomial curve. :-) )
Re:Reed Solomon codes are cool
by aaaaaaaaaaab on Monday February 25, 2019 @05:29PM
(#19250092)
Indeed, the wikipedia article on RS codes [1] mentions this equivalence between the DFT and RS encoding/decoding.
They mention that both procedures are basically a multiplication by a Vandermonde matrix, with the Fourier transform having the additional requirement of using the n-th roots of unity.
https://en.m.wikipedia.org/wiki/Reed–Solomon_error_correctio...
Also, the BCH encoder multiplies the input sequence with the generator polynomial, which is a convolution of their coefficients. Fourier-type transforms (i.e. number theoretic transform) relate convolution and pointwise multiplication, so I feel there’s an underlying connection here, but I don’t have enough experience with finite fields to connect the dots...