Reed-Solomon: generator matrix and generator polynomial approaches?
Hi,
Where can I find a proof in literature (or maybe someone can show me)
why the following two approaches generate the same (n,k) RS code?
The one approach is to generate the (n,k) RS code by the generator
matrix:
1 1 1 ... 1
1 \alpha^1 \alpha^2 ... \alpha^{n-2}
1 \alpha^2 (\alpha^2)^2 ... (\alpha^2)^{n-2}
G = .
|