Sergei V. Fedorenko

Orcid: 0000-0003-0099-0000

Affiliations:
  • National Research University Higher School of Economics, HSE Campus in St. Petersburg, Russia
  • St.Petersburg State University of Aerospace Instrumentation, St. Petersburg, Russia (former)


According to our database1, Sergei V. Fedorenko authored at least 24 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The Discrete Fourier Transform Over the Binary Finite Field.
IEEE Access, 2023

2022
A Spectral Algorithm for Decoding Systematic BCH Codes.
IEEE Access, 2022

2021
Efficient Algorithm for Finding Roots of Error-Locator Polynomials.
IEEE Access, 2021

2020
Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field.
IEEE Trans. Signal Process., 2020

2019
Efficient Syndrome Calculation via the Inverse Cyclotomic Discrete Fourier Transform.
IEEE Signal Process. Lett., 2019

Construction of the solution of the Chinese Remainder Theorem for polynomials using the method of undetermined coefficients.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

2018
The inverse cyclotomic Discrete Fourier Transform algorithm.
CoRR, 2018

2016
Improving the Goertzel-Blahut Algorithm.
IEEE Signal Process. Lett., 2016

An Invariant Subcode of Linear Code.
Proceedings of the Intelligent Interactive Multimedia Systems and Services 2016, 2016

2015
Normalized Cyclic Convolution: The Case of Even Length.
IEEE Trans. Signal Process., 2015

2013
Pseudo-ternary run-length limited spectrum shaped codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2011
A novel method for computation of the discrete Fourier transform over characteristic two finite field of even extension degree
CoRR, 2011

The discrete Fourier transform over a finite field with reduced multiplicative complexity.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2009
On semifast Fourier transform algorithms
CoRR, 2009

A simple algorithm for decoding both errors and erasures of Reed-Solomon codes
CoRR, 2009

2007
The star trellis decoding of Reed-Solomon codes
CoRR, 2007

2006
Correction to "A Simple Algorithm for Decoding Reed-Solomon Codes and Its Relation to the Welch-Berlekamp Algorithm".
IEEE Trans. Inf. Theory, 2006

A method for computation of the discrete Fourier transform over a finite field.
Probl. Inf. Transm., 2006

2005
A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm.
IEEE Trans. Inf. Theory, 2005

2004
On computing the syndrome polynomial in Reed-Solomon decoder.
Eur. Trans. Telecommun., 2004

2003
A Method for Fast Computation of the Fourier Transform over a Finite Field.
Probl. Inf. Transm., 2003

Improved hybrid algorithm for finding roots of error-locator polynomials.
Eur. Trans. Telecommun., 2003

2002
Finding roots of polynomials over finite fields.
IEEE Trans. Commun., 2002

1993
Tables of Coverings for Decoding by S-Sets.
Proceedings of the Error Control, Cryptology, and Speech Compression, 1993


  Loading...