default search action
Sergei V. Fedorenko
Person information
- affiliation: National Research University Higher School of Economics, HSE Campus in St. Petersburg, Russia
- affiliation (former): St.Petersburg State University of Aerospace Instrumentation, St. Petersburg, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Sergei Valentinovich Fedorenko:
The Discrete Fourier Transform Over the Binary Finite Field. IEEE Access 11: 62771-62779 (2023) - 2022
- [j13]Sergei Valentinovich Fedorenko:
A Spectral Algorithm for Decoding Systematic BCH Codes. IEEE Access 10: 110639-110645 (2022) - 2021
- [j12]Sergei Valentinovich Fedorenko:
Efficient Algorithm for Finding Roots of Error-Locator Polynomials. IEEE Access 9: 38673-38686 (2021) - 2020
- [j11]Sergei Valentinovich Fedorenko:
Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field. IEEE Trans. Signal Process. 68: 4813-4823 (2020)
2010 – 2019
- 2019
- [j10]Sergei Valentinovich Fedorenko:
Efficient Syndrome Calculation via the Inverse Cyclotomic Discrete Fourier Transform. IEEE Signal Process. Lett. 26(9): 1320-1324 (2019) - [c5]Andrey E. Krouk, Sergei Valentinovich Fedorenko:
Construction of the solution of the Chinese Remainder Theorem for polynomials using the method of undetermined coefficients. REDUNDANCY 2019: 115-116 - 2018
- [i7]Sergei V. Fedorenko:
The inverse cyclotomic Discrete Fourier Transform algorithm. CoRR abs/1809.09459 (2018) - 2016
- [j9]Sergei Valentinovich Fedorenko:
Improving the Goertzel-Blahut Algorithm. IEEE Signal Process. Lett. 23(6): 824-827 (2016) - [c4]Sergei V. Fedorenko, Eugenii Krouk:
An Invariant Subcode of Linear Code. IIMSS 2016: 169-178 - 2015
- [j8]Sergei V. Fedorenko:
Normalized Cyclic Convolution: The Case of Even Length. IEEE Trans. Signal Process. 63(20): 5307-5317 (2015) - 2013
- [c3]Oleg Kurmaev, Yanxing Zeng, Sergei V. Fedorenko, Vladimir Ivanov, Jianqiang Shen:
Pseudo-ternary run-length limited spectrum shaped codes. ISIT 2013: 146-150 - 2011
- [c2]Sergei V. Fedorenko:
The discrete Fourier transform over a finite field with reduced multiplicative complexity. ISIT 2011: 1200-1204 - [i6]Sergei V. Fedorenko:
A novel method for computation of the discrete Fourier transform over characteristic two finite field of even extension degree. CoRR abs/1112.1639 (2011)
2000 – 2009
- 2009
- [i5]Sergei V. Fedorenko:
A simple algorithm for decoding both errors and erasures of Reed-Solomon codes. CoRR abs/0904.2861 (2009) - [i4]Sergei V. Fedorenko:
On semifast Fourier transform algorithms. CoRR abs/0907.1975 (2009) - 2007
- [i3]Sergei V. Fedorenko:
The star trellis decoding of Reed-Solomon codes. CoRR abs/0707.1025 (2007) - 2006
- [j7]Sergei V. Fedorenko:
A method for computation of the discrete Fourier transform over a finite field. Probl. Inf. Transm. 42(2): 139-151 (2006) - [j6]Sergei V. Fedorenko:
Correction to "A Simple Algorithm for Decoding Reed-Solomon Codes and Its Relation to the Welch-Berlekamp Algorithm". IEEE Trans. Inf. Theory 52(3): 1278 (2006) - [i2]Sergei V. Fedorenko, Peter Vladimirovich Trifonov:
Finding roots of polynomials over finite fields. CoRR abs/cs/0606035 (2006) - 2005
- [j5]Sergei V. Fedorenko:
A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm. IEEE Trans. Inf. Theory 51(3): 1196-1198 (2005) - [i1]Sergei V. Fedorenko:
A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm. CoRR abs/cs/0501011 (2005) - 2004
- [j4]Elena Costa, Sergei V. Fedorenko, Peter Vladimirovich Trifonov:
On computing the syndrome polynomial in Reed-Solomon decoder. Eur. Trans. Telecommun. 15(4): 337-342 (2004) - 2003
- [j3]Sergei V. Fedorenko, Peter Trifonov, Elena Costa:
Improved hybrid algorithm for finding roots of error-locator polynomials. Eur. Trans. Telecommun. 14(5): 411-416 (2003) - [j2]Peter Trifonov, Sergei V. Fedorenko:
A Method for Fast Computation of the Fourier Transform over a Finite Field. Probl. Inf. Transm. 39(3): 231-238 (2003) - 2002
- [j1]Sergei V. Fedorenko, Peter Trifonov:
Finding roots of polynomials over finite fields. IEEE Trans. Commun. 50(11): 1709-1711 (2002)
1990 – 1999
- 1993
- [c1]I. L. Asnis, Sergei V. Fedorenko, E. A. Krouk, E. T. Mironchikov:
Tables of Coverings for Decoding by S-Sets. Error Control, Cryptology, and Speech Compression 1993: 97-102
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint