The inverse cyclotomic Discrete Fourier Transform algorithm
The proof of the theorem concerning to the inverse cyclotomic Discrete Fourier Transform algorithm over finite field is provided.
cs.IT↗
arXiv subjects
Sergei V. Fedorenko
Publications and source records attributed to Sergei V. Fedorenko.
A novel method for computation of the discrete Fourier transform over characteristic two finite field of even extension degree
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 minimized, then the novel method for the finite field of even extension degree is the best known method of the discrete Fourier transform computation. A constructive method of constructing for a cyclic convolution over a finite field is introduced.
cs.IT↗
On semifast Fourier transform algorithms
We consider the relations between well-known Fourier transform algorithms.
cs.IT↗
A simple algorithm for decoding both errors and erasures of Reed-Solomon codes
A simple algorithm for decoding both errors and erasures of Reed-Solomon codes is described.
cs.IT↗
Finding roots of polynomials over finite fields
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, Reed-Solomon, and some other error-correcting codes.
cs.IT↗