| Finding roots of polynomials over finite fields SV Fedorenko, PV Trifonov Communications, IEEE Transactions on 50 (11), 1709 - 1711, 2002 | 86 | 2002 |
| A method for fast computation of the Fourier transform over a finite field PV Trifonov, SV Fedorenko Problems of Information Transmission 39 (3), 231-238, 2003 | 75 | 2003 |
| On computing the syndrome polynomial in Reed–Solomon decoder E Costa, SV Fedorenko, PV Trifonov European transactions on telecommunications 15 (4), 337-342, 2004 | 45 | 2004 |
| A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm SV Fedorenko Information Theory, IEEE Transactions on 51 (3), 1196 - 1198, 2005 | 37 | 2005 |
| A method for computation of the discrete Fourier transform over a finite field SV Fedorenko Problems of information transmission 42 (2), 139-151, 2006 | 31 | 2006 |
| Методы быстрого декодирования линейных блоковых кодов С Федоренко ГУАП, 2008 | 20 | 2008 |
| Простой алгоритм декодирования алгебраических кодов С Федоренко Информационно-управляющие системы, 23-27, 2008 | 15 | 2008 |
| On computing the fast Fourier transform over finite fields S Fedorenko, P Trifonov Proc. 8th Int. Workshop on Algebraic and Combinatorial Coding Theory …, 2002 | 14 | 2002 |
| The discrete Fourier transform over a finite field with reduced multiplicative complexity SV Fedorenko 2011 IEEE International Symposium on Information Theory Proceedings, 1200-1204, 2011 | 12 | 2011 |
| Improved hybrid algorithm for finding roots of error-locator polynomials S Fedorenko, P Trifonov, E Costa European Transactions on Telecommunications 14 (5), 411-416, 2003 | 12 | 2003 |
| Correction to “A Simple Algorithm for Decoding Reed–Solomon Codes and Its Relation to the Welch–Berlekamp Algorithm“ SV Fedorenko Information Theory, IEEE Transactions on 52 (3), 1278-1278, 2006 | 10 | 2006 |
| Efficient syndrome calculation via the inverse cyclotomic discrete Fourier transform SV Fedorenko IEEE Signal Processing Letters 26 (9), 1320-1324, 2019 | 9 | 2019 |
| Improving the Goertzel-Blahut algorithm SV Fedorenko IEEE Signal Processing Letters 23 (6), 824 - 827, 2016 | 8 | 2016 |
| Normalized cyclic convolution: The case of even length SV Fedorenko IEEE Transactions on Signal Processing 63 (20), 5307-5317, 2015 | 8 | 2015 |
| A simple algorithm for decoding algebraic codes SV Fedorenko Information and control systems, 23-27, 2008 | 8 | 2008 |
| Duhamel/Hollmann-like discrete Fourier transform algorithm with the smallest multiplicative complexity over a finite field SV Fedorenko IEEE Transactions on Signal Processing 68, 4813-4823, 2020 | 7 | 2020 |
| The “Star Trellis” of the Golay Code U Sorger, S Fedorenko The Seventh International Workshop on Algebraic and Combinatorial Coding …, 2000 | 7 | 2000 |
| Decoding by generalized information sets EA Kruk, SV Fedorenko Problemy Peredachi Informatsii 31 (2), 54-61, 1995 | 7 | 1995 |
| Efficient algorithm for finding roots of error-locator polynomials SV Fedorenko IEEE Access 9, 38673-38686, 2021 | 5 | 2021 |
| Improved list decoding of tail-biting convolutional codes SV Fedorenko, M Trefilov, Y Wei 2014 XIV International Symposium on Problems of Redundancy in Information …, 2014 | 5 | 2014 |
peter trifonovITMO UniversityVerified email at itmo.ru
