alexeyfrolov



Personal Websites

Alexey Frolov

Full Professor
Project Center for Next Generation Wireless and IoT

Dr. Alexey Frolov received the M.Sc. degree in computer science from Bauman Moscow State Technical University (BMSTU) in 2010,  the Ph.D. degree in mathematics from the Institute for Information Transmission Problems (IITP), Russian Academy of Sciences (RAS), in 2012 and the D.Sc. degree in mathematics from Moscow Institute of Physics and Technology (MIPT) in 2021. He is currently a Full Professor at the Skolkovo Institute of Science and Technology (Skoltech), Moscow, Russia. His research interests include information theory and its applications in telecommunications, storage systems, and other areas. He was a recipient of the IEEE GLOBECOM Communication Theory Symposium Best Paper Award in 2020, the Russian Government Award in Science and Technology for Young Scientists in 2016 and the Moscow Government Award for Young Scientists in 2013.

Open PhD positions:

  • Deep Neural Network Based Decoding of Error-Correcting Codes
  • Design of Polar Codes for Multiple Access Channels
  • Information Theory for Deep Learning
  • Coded Distributed Computing
  • Information theory for deep learning
  • Machine learning in communications
  • Coded Distributed Computing
  • LDPC and Polar codes and their applications to future 5G wireless networks
  • Non-orthogonal multiple access (NOMA) schemes for massive Internet of Things
  • Random access protocols (coded slotted ALOHA)
  • Coding for distributed and cloud storage systems
  • Coding for fiber optic lines.
  • Post-quantum (code and lattice-based) cryptography.

See the Research details and PhD positions. Application procedure details.

Selected journal publications

  1. K. Andreev, P. Rybin and A. Frolov, Coded Compressed Sensing with List Recoverable Codes for the Unsourced Random Access,  IEEE Transactions on Communications, 2022, 70:12, pp. 7886-7898.
  2. L. Holzbaur, S. Kruglik, A. Frolov, A. Wachter-Zeh, Secure Codes with Accessibility for Distributed Storage, IEEE Transactions on Information Forensics & Security, 2021, vol. 16, 5326-5337.
  3. I. Butakov, S. Malanchuk, A. Neopryatnaya,  A. Tolmachev, K. Andreev, S. Kruglik, E. Marshakov and A. Frolov, High-Dimensional Dataset Entropy Estimation via Lossy Compression. J. Commun. Technol. Electron. 2021, 66, 764–768.
  4. S. S. Kowshik, K. Andreev, A. Frolov and Y. Polyanskiy, Energy efficient coded random access for the wireless uplink, IEEE Transactions on Communications, 2020, 68:8, 4694-4708.
  5. S. Kruglik, K. Nazirkhanova and A. Frolov, New Bounds and Generalizations of Locally Recoverable Codes With Availability, IEEE Transactions on Information Theory, 2019, 65:7, 4156-4166.
  6. A. Frolov, V. Zyablov, On the multiple threshold decoding of LDPC codes over GF(q), Advances in Mathematics of Communications, 2017, 11:1, 123-137.
  7. I. Tamo, A. Barg and A. Frolov, Bounds on the Parameters of Locally Recoverable Codes, IEEE Transactions on Information Theory, 2016, 62:6, 3070-3083.
  8. A. Frolov, Upper bound on the minimum distance of LDPC codes over GF(q) based on counting the number of syndromes, Problems of Information Transmission, 2016, 52:1, 6–13.
  9. A .Frolov and V. Zyablov, On the capacity of a multiple-access vector adder channel, Problems of Information Transmission, 2014, 50:2, 133–143.
  10. D. Osipov, A. Frolov and V. Zyablov, On the user capacity for a multiple-access system in a vector disjunctive channel with errors, Problems of Information Transmission, 2013, 49:4, 308–321.
  11. D. Osipov, A. Frolov and V. Zyablov, Multiple access system for a vector disjunctive channel, Problems of Information Transmission, 2012, 48:3, 243–249.
  12. A.Frolov and V. Zyablov, Bounds on the minimum code distance for nonbinary codes based on bipartite graphs, Problems of Information Transmission, 2011, 47:4, 327–341.
  13. A. Frolov and V. Zyablov, Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes, Problems of Information Transmission, 2010, 46:2, 142–159.

 

Selected conference proceedings

  1. K. Andreev, P. Rybin and A. Frolov, Unsourced Random Access Based on List Recoverable Codes Correcting t Errors, in Proc. IEEE Information Theory Workshop (ITW), 2021, pp. 1-6.
  2. K. Andreev, A. Frolov, G. Svistunov, K. Wu and J. Liang, Deep Neural Network Based Decoding of Short 5G LDPC Codes, XVII International Symposium “Problems of Redundancy in Information and Control Systems” (REDUNDANCY), 2021, pp. 155-160.
  3. G. Balitskiy, A. Frolov and P. Rybin, Linear Programming Decoding of Non-Linear Sparse-Graph Codes, XVII International Symposium “Problems of Redundancy in Information and Control Systems” (REDUNDANCY), 2021, pp. 149-154.
  4. A. Munari and A. Frolov,  Average Age of Information of Irregular Repetition Slotted ALOHA, in Proc. IEEE Global Communications Conference (GLOBECOM), Taipei, Taiwan, 2020, pp. 1-6, 2020 (best paper award).
  5. L. Holzbaur, S. Kruglik, A. Frolov and A. Wachter-Zeh,  Secrecy and Accessibility in Distributed Storage, in Proc. IEEE Global Communications Conference (GLOBECOM), Taipei, Taiwan, 2020, pp. 1-6, 2020.
  6. K. Andreev, E. Marshakov and A. Frolov, A Polar Code Based TIN-SIC Scheme for the Unsourced Random Access in the Quasi-Static Fading MAC, In Proc. IEEE Int. Symp. Inf. Theory (ISIT), Los Angeles, CA, USA, 2020, pp. 3019-3024.
  7. Kowshik S. S., Andreev K., Frolov A. and Polyanskiy Y., Energy efficient random access for the quasi-static fading MAC, In Proc. IEEE Int. Symp. Inf. Theory (ISIT), Paris, France, 2019, pp. 2768-2772.
  8. Glebov A., Matveev N., Andreev K.,  FrolovA. , Turlikov A., Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC, In Proc. IEEE Wireless Communications and Networking Conference (WCNC), pp. 1–5, 2019.
  9. Marshakov E., Balitskiy G., Andreev K. and Frolov A. A Polar Code Based Unsourced Random Access for the Gaussian MAC, In Proc. IEEE 90th Vehicular Technology Conference (VTC2019-Fall), Honolulu, Hawaii, USA, Sep. 2019.
  10. Kruglik S., Dudina M., Potapova V., Frolov A. On One Generalization of LRC Codes with Availability , In Proc. IEEE Information Theory Workshop (ITW), Kaohsiung, Taiwan. pp.1-5, November 6-10, 2017.
  11. Kruglik S., Frolov A. Bounds and Constructions of Codes with All-Symbol Locality and Availability, In Proc. IEEE Int. Symp. Inf. Theory (ISIT), Aachen, Germany, June 25-30, 2017, pp. 1023-1027.
  12. Frolov A. and Zyablov V. On the Multiple Threshold Decoding of LDPC codes over GF(q), In Proc. IEEE Int. Symp. Inf. Theory (ISIT), Hong Kong, China, June 14-19 2015, pp. 2673-2677.
  13. Frolov A., An Upper Bound on the Minimum Distance of LDPC Codes over GF(q), In Proc. IEEE Int. Symp. Inf. Theory (ISIT), Hong Kong, China, June 14-19 2015, pp. 2885-2888.
  14. Frolov A., Zyablov V., Sidorenko V., Fischer R., On a multiple-access in a vector disjunctive channel, In Proc. IEEE Int. Symp. Inf. Theory (ISIT), Istanbul, Turkey, July 7-12 2013, pp. 211-215.
  15. Frolov A., Zyablov V. Upper and Lower Bounds on the Minimum Distance of Expander Codes, In Proc. IEEE Int. Symp. Inf. Theory (ISIT), Saint-Petersburg, Russia, 2011, pp. 1302–1306.

2010–2012      Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

Ph.D, Physical and Mathematical Sciences

Supervisior:  Professor V.V. Zyablov

Thesis: Error-correcting capabilities of non-binary LDPC codes.

2004–2010      Bauman Moscow State Technical University, Moscow, Russia

Specialist, Computer science and control systems (Grade: 5.0/5.0)

Supervisior:  Professor V.V. Zyablov

Thesis: Development of decoding algorithms for non-binary LDPC codes.

  • 2020    Communication Theory Symposium Best Paper Award, IEEE Global Communications Conference (GLOBECOM)
  • 2016    Russian Government Award in Science and Technology for Young Scientists
    Topic: Research and development of protocols for perspective wireless networks
  • 2013    Moscow Government Award for Young Scientists
    Topic: Development of multiple access techniques, which increase reliability of multimedia data delivery in real time
  • 2013    Russian President Scholarship
    Topic: Coded modulation based on low-complexity decoded codes for next generation wireless systems

Current PhD students:

Current MSc students:

  • Mariia Savinova
  • Anastasiia Kurmukova
  • Dmitry Artemasov
  • Maxim Kurkin
  • Kelvin Kutsukutsa
  • Farid Davletshin
  • Kseniia Kuvshinova

Former PhD students:

Former MSc students

  • Kamilla Nazirkhanova, PhD student, Stanford University, MSc thesis: Codes Correcting Tandem Duplications
  • Nikita Zeulin, PhD student, Tampere University, MSc thesis: Research on decoding algorithms beyond half designed distance in the Manhattan metric
  • Andrei Gorokhov, Huawei, MSc thesis: Research and development of decoding methods for LDPC codes in 5G networks
  • Rostislav Shaniiazov, PhD student, MIEM HSE, MSc thesis: Research of coding-modulation scheme considering statistical properties of a data source
  • Mariia Kopylova, MSc thesis: Coded Distributed Computations for Matrix Multiplication tasks
  • Anhelina Yarashenka, MSc thesis: Application of Compressed Sensing for Fading Channels
  • Ekaterina Chukavina, MSc thesis: Development of Quantized Message-Passing Decoders for 5G LDPC-Codes
  • Semen Kuzmichev, MSc thesis: Research of a coding scheme for massive random access without source identification and with multiple antennas at the receiver
  • Andrei Dzis, MSc thesis: On Freshness of Information for Multiple Random Access
  • Nikolay Osipov, MSc thesis: Investigation QC-MDPC codes decoding methods for application in post quantum cryptography
  • Ivan Naidenov, MSc thesis: Application of deep learning methods for decoding of linear codes

Introduction to Blockchain (Skoltech, Term 2)
Information and Coding Theory (Skoltech, Term 3)