Results 171 to 180 of about 19,178 (185)
Some of the next articles are maybe not open access.
2019
This chapter begins by defining the discrete Fourier transform, a square matrix \(\mathcal {F}\) whose entries are roots of unity of some field, and whose inverse is easy to write down and has almost the same form as \(\mathcal {F}\). We then look at two examples of Reed-Solomon codes, based on fields with 8 and 13 elements, respectively.
openaire +1 more source
This chapter begins by defining the discrete Fourier transform, a square matrix \(\mathcal {F}\) whose entries are roots of unity of some field, and whose inverse is easy to write down and has almost the same form as \(\mathcal {F}\). We then look at two examples of Reed-Solomon codes, based on fields with 8 and 13 elements, respectively.
openaire +1 more source
Bit-serial Reed - Solomon encoders
IEEE Transactions on Information Theory, 1982openaire +2 more sources