Sergei Fedorenko
Professor Dr. Sergei Valentinovich Fedorenko
Centre for Data Analysis and Machine Learning/
Department of Informatics at
St. Petersburg School of Physics, Mathematics, and Computer Science
National Research University Higher School of Economics,
HSE Campus in St.Petersburg, Russia
Email: sergei.fedorenko [$$$] gmail.com
Journal papers
1. Fedorenko, S.V. (2023): The discrete Fourier transform over the binary finite field. IEEE Access. Vol.11, 62771-62779. IEEExplore ; PDF
2. Fedorenko, S.V. (2022): A spectral algorithm for decoding systematic BCH codes. IEEE Access. Vol.10, 110639-110645. IEEExplore ; PDF
3. Fedorenko, S.V. (2021): Efficient algorithm for finding roots of error-locator polynomials. IEEE Access. Vol.9, 38673-38686. IEEExplore ; PDF
4. Fedorenko, S.V. (2020): Duhamel/Hollmann-like discrete Fourier transform algorithm with the smallest multiplicative complexity over a finite field. IEEE Transactions on Signal Processing. Vol.68, 4813-4823. IEEExplore ; PDF
5. Fedorenko, S.V. (2019): Efficient syndrome calculation via the inverse cyclotomic discrete Fourier transform. IEEE Signal Processing Letters. Vol.26, No 9, 1320-1324. IEEExplore ; PDF
6. Fedorenko, S.V. (2016): Improving the Goertzel-Blahut algorithm. IEEE Signal Processing Letters. Vol.23, No 6, 824-827. IEEExplore ; PDF
7. Fedorenko, S.V. (2015): Normalized cyclic convolution: The case of even length. IEEE Transactions on Signal Processing. Vol.63, No 20, 5307-5317. IEEExplore ; PDF
8. Fedorenko, S.V. (2006): A method for computation of the discrete Fourier transform over a finite field. Problemy Peredachi Informatsii 42, No 2, 81-93 (in Russian); PDF
English translation in Problems of Information Transmission 42 (2006), No 2, 139-151. PDF
9. Fedorenko, S. (2005): A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm. IEEE Transactions on Information Theory, Vol.51, No 3, 1196-1198. With Correction. PDF
10. Costa, E., Fedorenko, S.V., Trifonov, P.V. (2004): On computing the syndrome polynomial in Reed-Solomon decoder. European Transactions on Telecommunications. Vol.15, No 4, 337-342. PDF
11. Fedorenko, S., Trifonov, P. and Costa, E. (2003): Improved hybrid algorithm for finding roots of error-locator polynomials. European Transactions on Telecommunications. Vol.14, No 5, 411-416. PDF
12. Trifonov, P.V. and Fedorenko, S.V. (2003): A method for fast computation of the Fourier transform over a finite field. Problemy Peredachi Informatsii 39, No 3, 3-10 (in Russian); PDF
English translation in Problems of Information Transmission 39 (2003), No 3, 231-238. PDF
13. Fedorenko, S. and Trifonov, P. (2002): Finding roots of polynomials over finite fields. IEEE Transactions on Communications, Vol.50, No 11, 1709-1711. PDF
14. Mironchikov, E.T. and Fedorenko, S.V. (1999): About algebraic decoding of cyclic codes. Problemy Peredachi Informatsii 35, No 1, 44-48 (in Russian); PDF
English translation in Problems of Information Transmission 35 (1999), No 1, 37-41. PDF
15. Krouk, E.A. and Fedorenko, S.V. (1995): Decoding by generalized information sets. Problemy Peredachi Informatsii 31, No 2, 54-61 (in Russian); PDF
English translation in Problems of Information Transmission 31 (1995), No 2, 143-149. PDF
16. Fedorenko, S.V. (1993): Complexity of the decoding of linear block codes. Problemy Peredachi Informatsii 29, No 4, 18-23 (in Russian); PDF
English translation in Problems of Information Transmission 29 (1993), No 4, 313-317 (1994). PDF
17. Mironchikov, E.T. and Fedorenko, S.V. (1993): Decoding of (L,g)-codes by generalized information sets. Problemy Peredachi Informatsii 29, No 4, 94-98 (in Russian); PDF
English translation in Problems of Information Transmission 29 (1993), No 4, 381-384 (1994). PDF
Conference papers
1. Krouk, A.E., Fedorenko, S.V. (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" (REDUNDANCY), Moscow, Russia, pp. 115-116. IEEExplore ; PDF
2. Fedorenko, S. (2018): The inverse cyclotomic Discrete Fourier Transform algorithm. Proceedings of Sixteenth International Workshop on Algebraic and Combinatorial Coding Theory at Svetlogorsk, Russia, September 2-8, pp. 185-188. PDF
3. Fedorenko, S., Shmelkin, D. (2016): Construction of the inverse matrix to a block upper triangular matrix. Proceedings of the XV international symposium on problems of redundancy in information and control systems at St.Petersburg, Russia, pp. 43-44. PDF
4. Fedorenko, S.V., Krouk, E. (2016): An invariant subcode of linear code. Intelligent Interactive Multimedia Systems and Services 2016, Smart Innovation, Systems and Technologies 55, 169-178. Springer Link ; PDF
5. Fedorenko, S., Trefilov, M., Wei, Y. (2014): Improved list decoding of tail-biting convolutional codes. Proceedings of the XIV international symposium on problems of redundancy in information and control systems at St.Petersburg, Russia, pp. 35-38. PDF
6. Fedorenko, S. (2012): The Goertzel-Blahut algorithm is closely related to the fast Fourier transform. Proceedings of the XIII international symposium on problems of redundancy in information and control systems at St.Petersburg, Russia, pp. 20-21. PDF
7. Fedorenko, S.V. (2011): The discrete Fourier transform over a finite field with reduced multiplicative complexity. Proceedings of the IEEE International Symposium on Information Theory at Saint-Petersburg, Russia, pp. 1200-1204. PDF
8. Fedorenko, S.V. (2009): On semifast Fourier transform algorithms. Proceedings of the XII international symposium on problems of redundancy in information and control systems at St.Petersburg, Russia, pp. 65-70. PDF
9. Fedorenko, S.V. (2008): A simple algorithm for decoding both errors and erasures of Reed-Solomon codes. Proceedings of the Workshop "Coding Theory Days in St. Petersburg", Russia. pp. 18-21. PDF
10. Fedorenko, S.V. (2007): The star trellis decoding of Reed-Solomon codes. Proceedings of the XI international symposium on problems of redundancy in information and control systems at St.Petersburg, Russia, pp. 58-61. PDF
11. Fedorenko, S. and Krouk, E. (2002): Decoding beyond the designed error correcting capability on the basis of supercodes. Proceedings of the IEEE International Symposium on Information Theory at Lausanne, Switzerland, p. 89. Full Version. PDF
12. Fedorenko, S. and Krouk, E. (2002): A survey of the hard decision decoding for linear block codes. Proceedings of the workshop on concepts in information theory, Breisach, Germany, pp. 15-18. PDF
13. Sorger, U. and Fedorenko, S. (2000): The "Star Trellis" of the Golay Code. Proceedings of Seventh International Workshop on Algebraic and Combinatorial Coding Theory at Bansko, Bulgaria, pp. 288-292. PDF
14. Fedorenko, S. (1999): On the structure of linear block codes given the group of symmetry. Proceedings of IEEE International workshop on concatenated codes, Schloss Reisensburg by Ulm, Germany, pp. 1-2. Generator matrix of (48,24,12) quadratic-residue code. PDF
Patents
1. Andrey Lvovich Chmora, Sergei Valentinovich Fedorenko, Victor Vasilievich Zyablov. (2017): Method and device for encoding/decoding data by using m-th order GEL codes. WO 2017078562 A1 dated 11 May 2017.
Also published as: CN108292925 (A).
2. Sergei Fedorenko, Mikhail Trefilov, Wei Yuejun. (2015): Decoding method and device. WO2015109741 (A1) dated 30.07.2015.
Also published as: CN104796160 (A), CN104796160 (B).
Abstract. Disclosed are a decoding method and device. The method comprises: determining an initial state from all the states at all the moments of a tail-biting convolutional code, wherein the number of all the moments is determined by the sequence length K of an original information sequence of the tail-biting convolutional code, the number of all the states is determined by the number of shift registers of an encoder, and the tail-biting convolutional code is acquired by the encoding of the original information sequence by the encoder; conducting LVA decoding on the tail-biting convolutional code according to the initial state to acquire Lc code words, wherein the initial state corresponds to the Lth bit of the original information sequence; circularly shifting the Lc code words to the right by L bits or circularly shifting same to the left by K-L bits respectively; and acquiring a decoding result according to the circularly shifted code words. By means of such a decoding method and device, the initial state can be more accurately found, and the decoding complexity can be reduced, so that the decoding performance can be improved.
3. Costa, E., Fedorenko, S., Krouk, E., Lott, M., Schulz, E., Trifonov, P. (2003): Method and device for a communication system for finding roots of an error locator polynomial. European patent application, EP1367727 A1 dated 03.12.2003.
Abstract. The method involves determining the roots of a fault position polynomial with a polynomial degree in two steps, the first involving breaking the polynomial down into a sum with affine polynomials, for which a sub-set of the roots is determined, determining a reduced polynomial of lower order and a second step involving carrying out a conventional root location process to find the roots of the lower order reduced polynomial. AN Independent claim is also included for the following: (a) a communications system for processing input data in accordance with the inventive method.
Verfahren und Kommunikationssystemvorrichtung zum Auffinden von Wurzeln eines Fehlerstellenpolynoms. Europäische patentanmeldung (in German). PDF
4. Evseev, G.S., Krouk, E.A., Samujlova, S.B. and Fedorenko, S.V. (1988): Device for decoding of cyclic codes. USSR Patent, No 1396933 dated 15.01.1988 (in Russian).
Supplementary materials
1. Fedorenko, S.V. (2016): Improving the Goertzel-Blahut algorithm: An example. Supplementary material for the paper "Improving the Goertzel-Blahut algorithm" (IEEE Signal Processing Letters, 2016, Vol.23, No 6, 824-827). PDF
Публикации на русском языке
1. Монография
Федоренко С.В. (2008): Методы быстрого декодирования линейных блоковых кодов. Монография. СПб.: ГУАП. 199 с. PDF
2. Федоренко С.В. (2008): Простой алгоритм декодирования алгебраических кодов. Информационно-управляющие системы. No 3. С. 23-27. PDF
3. Федоренко С.В. (2013): Модификация алгоритма Герцеля-Блейхута. Известия высших учебных заведений. Приборостроение. Том 56. Выпуск 8. С. 17-20. PDF
Last Modified: 27.07.2023, Sergei Fedorenko