Decoding algorithms for Reed–Solomon (RS) codes are of great interest for both practical
and theoretical reasons. In this paper, an efficient algorithm, called the modular approach …

Fast Encoding of Polar Codes With Reed–Solomon Kernel Page 1 2746 IEEE
TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 7, JULY 2016 Fast Encoding of Polar …

The novel methods for binary discrete Fourier transform (DFT) computation over the finite
field have been proposed. The methods are based on a binary trace calculation over the …

An effective calculation of the Reed-Solomon code syndrome is proposed. The method is
based on the use of the partial normalized cyclic convolutions in the partial inverse …

The new method for the discrete Fourier transform computation over a finite field is
introduced. This method is a nontrivial generalization of the Duhamel-Hollmann algorithm …

A novel method for finding roots of polynomials over finite fields has been proposed. This
method is based on the cyclotomic discrete Fourier transform algorithm. The improvement is …

Fast algorithms are proposed for encoding and reconstructing data in RAID based on Reed-
Solomon codes. The proposed approach is based on the cyclotomic fast Fourier transform …

Актуальность темы исследования. Быстрый рост объема цифровых данных, произ
водимых и обрабатываемых различными техническими системами, требует создания …

In this work, a novel gate-level delay computing method for common subexpression
elimination (CSE) algorithm is proposed. The computing method is based on delay matrix …

A novel method for computing the discrete Fourier transform (DFT) over a finite field based
on the Goertzel-Blahut algorithm is described. The novel method is currently the best one for …