Выходит 12 номеров в год
ISSN Печать: 0040-2508
ISSN Онлайн: 1943-6009
Indexed in
APPLICATION OF FAST POLYNOMIAL TRANSFORMATIONS OVER GALOIS GF(2m) FIELDS IN REED−SOLOMON CODING AND DECODING
Краткое описание
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.
-
Chen, C. L., Formula for the solution of quadratic equation over GF(2m).
-
Kvashennikov, V. V. and Yakovlev, V. G., A note on the solution of quadratic equations over Galois fields.
-
Shabanov, V. K., Method for reduction of the number of FFT procedure operations and building of RS codes optimal for processing.
-
Trifonov, P. V. and Fedorenko, S. V., Method of fast Fourier transformation over a finite field.
-
Zakharova, T. G., Computation of Fourier transformation in the fields of characteristic 2.