APPLICATION OF FAST POLYNOMIAL TRANSFORMATIONS OVER GALOIS GF(2m) FIELDS IN REED-SOLOMON CODING AND DECODING
V. V. Kvashennikov · Telecommunications and Radio Engineering · 2012
Accelerated algorithms for coding and computing the syndrome of Reed−Solomon code over Galois GF(2m) fields, using polynomial transformations for increasing the operational speed, are proposed. The computational complexity of such transformations by the total number of operations of addition and multiplication over the GF(2m) field is commensurable with the best known fast transformations.