A new decoding method for Reed–Solomon codes based on FFT and modular approach
N Tang, YS Han - IEEE Transactions on Communications, 2022 - ieeexplore.ieee.org
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 …
and theoretical reasons. In this paper, an efficient algorithm, called the modular approach …
Fast encoding of polar codes with Reed–Solomon kernel
P Trifonov, V Miloslavskaya, C Chen… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
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 …
TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 7, JULY 2016 Fast Encoding of Polar …
The discrete Fourier transform over the binary finite field
SV Fedorenko - IEEE Access, 2023 - ieeexplore.ieee.org
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 …
field have been proposed. The methods are based on a binary trace calculation over the …
Efficient syndrome calculation via the inverse cyclotomic discrete Fourier transform
SV Fedorenko - IEEE Signal Processing Letters, 2019 - ieeexplore.ieee.org
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 …
based on the use of the partial normalized cyclic convolutions in the partial inverse …
Duhamel/Hollmann-like discrete Fourier transform algorithm with the smallest multiplicative complexity over a finite field
SV Fedorenko - IEEE Transactions on Signal Processing, 2020 - ieeexplore.ieee.org
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 …
introduced. This method is a nontrivial generalization of the Duhamel-Hollmann algorithm …
Efficient algorithm for finding roots of error-locator polynomials
SV Fedorenko - IEEE Access, 2021 - ieeexplore.ieee.org
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 …
method is based on the cyclotomic discrete Fourier transform algorithm. The improvement is …
Low-complexity implementation of RAID based on Reed-Solomon codes
P Trifonov - ACM Transactions on Storage (TOS), 2015 - dl.acm.org
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 …
Solomon codes. The proposed approach is based on the cyclotomic fast Fourier transform …
Optimally Decoding Two-Dimensional Reed-Solomon Codes up to the Half-Singleton Bound
S Singhvi - arxiv preprint arxiv:2412.20771, 2024 - arxiv.org
Constructing Reed-Solomon (RS) codes capable of correcting insertion and deletion errors
(ins-del errors) has been the focus of numerous recent studies. However, the development …
(ins-del errors) has been the focus of numerous recent studies. However, the development …
[PDF][PDF] Improving common subexpression elimination algorithm with a new gate-level delay computing method
N Wu, X Zhang, Y Ye, L Lan - Proceedings of the World Congress on …, 2013 - iaeng.org
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 …
elimination (CSE) algorithm is proposed. The computing method is based on delay matrix …
Improving the Goertzel–Blahut algorithm
SV Fedorenko - IEEE Signal Processing Letters, 2016 - ieeexplore.ieee.org
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 …
on the Goertzel-Blahut algorithm is described. The novel method is currently the best one for …