63 citations · 106 across the 6 of their papers we have counts for
6 papers
A novel method for computation of the discrete Fourier transform over characteristic two finite field of even extension degree
Sergei V. Fedorenko
A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be…
On semifast Fourier transform algorithms
Sergei V. Fedorenko
We consider the relations between well-known Fourier transform algorithms.
A simple algorithm for decoding both errors and erasures of Reed-Solomon codes
Sergei V. Fedorenko
A simple algorithm for decoding both errors and erasures of Reed-Solomon codes is described.
The star trellis decoding of Reed-Solomon codes
Sergei Fedorenko
The new method for Reed-Solomon codes decoding is introduced. The method is based on the star trellis decoding of the binary image of Reed-Solomon codes.
Finding roots of polynomials over finite fields
Sergei V. Fedorenko, Piter V. Trifonov
We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem,…
A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm
Sergei Fedorenko
A simple and natural Gao algorithm for decoding algebraic codes is described. Its relation to the Welch-Berlekamp and Euclidean algorithms is given.