alexeyfrolov



Personal Websites

Alexey Frolov

Associate Professor
Center for Computational and Data-Intensive Science and Engineering

Dr. Alexey Frolov obtained his Specialist Diploma in Computer Science from the Bauman Moscow State Technical University (BMSTU) in 2010, and his Candidate of Sciences degree in Mathematics from the Institute for Information Transmission Problems of the Russian Academy of Sciences (IITP RAS) in 2012. During the following four years, Alexey did research internship at the Ulm University (Germany), Swiss Federal Institute of Technology (EPFL, Switzerland), University of Maryland (USA) and Israel Institute of Technology (Technion, Israel) which resulted in joint publications in leading journals on information and coding theory. Alexey has been a Senior Researcher at IITP RAS since 2013. In 2015-2016, Alexey was a project leader of a joint project of Huawei and IITP RAS on investigation and development of error-correcting codes for future 5G physical layer. Since 2016 he has been a Senior Research Scientist at Skolkovo Institute of Science and Technology (Skoltech). In  2017, Alexey has been appointed as an Assistant Professor at Skoltech. Since February 2019, he serves as an Associate Professor at Skoltech. Alexey is a recipient of Russian Government Award in Science and Technology for Young Scientists (2016), Moscow Government Award for Young Scientists (2013) and Russian President Scholarship (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. 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.
  2. 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.
  3. 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.
  4. 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.
  5. A .Frolov and V. Zyablov, On the capacity of a multiple-access vector adder channel, Problems of Information Transmission, 2014, 50:2, 133–143.
  6. A. Frolov and V. Zyablov., A Coding Technique for Q-Frequency S-User Gaussian Channel, Journal of Communications Technology and Electronics, 2014, Vol. 59, No. 12, pp. 1483–1488.
  7. 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.
  8. D. Osipov, A. Frolov and V. Zyablov, Multiple access system for a vector disjunctive channel, Problems of Information Transmission, 2012, 48:3, 243–249.
  9. 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.
  10. 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. 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.
  2. Andreev K., Kowshik S. S., Frolov A. and Polyanskiy Y., Low complexity energy efficient random access scheme for the asynchronous fading MAC, In Proc. IEEE 90th Vehicular Technology Conference (VTC2019-Fall), Honolulu, Hawaii, USA, Sep. 2019.
  3. 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.
  4. 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.
  5. Rybin P., Frolov A. On the Decoding Radius Realized by Low-Complexity Decoded Non-Binary Irregular LDPC Codes, In Proc. IEEE Int. Symp. Inf. Theory and its Applications (ISITA), Singapore, Singapore, 2018.
  6. Kruglik S., Nazirkhanova K. and Frolov A.  On Distance Properties of (r,t,x)-LRC Codes, In Proc. IEEE Int. Symp. Inf. Theory (ISIT), Vail, CO, pp. 1336-1339, 2018.
  7. 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.
  8. 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.
  9. Frolov A. and Zyablov V. A new coding method for a multiple-access system with a large number of active users, In Proc. IEEE Information Theory Workshop (ITW), Jerusalem, Israel. pp.1-5, April 26-May 1 2015.
  10. 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.
  11. 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.
  12. 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.
  13. 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.

  • LDPC codes
  • Polar codes
  • Generalized concatenated codes
  • Multiple access
  • Coding for distributed and cloud storage systems

Russian Government Award in Science and Technology for Young Scientists (2016)
Research and development of protocols for perspective wireless networks

Moscow Government Award for Young Scientists (2013)
Development of multiple access techniques, which increase reliability of multimedia data delivery in real time

Russian President Scholarship (2013)
Coded modulation based on low-complexity decoded codes for next generation wireless systems

Stanislav Kruglik (PhD student)
Evgeny Marshakov (PhD student)
Anton Glebov (PhD student)
Kamilla Nazirkhanova (MSc student)
Gleb Balitskiy (MSc student)
Andrei Dzis (MSc student)
Nikolay Osipov (MSc student)
Nikita Zeulin (MSc student)
Andrei Gorokhov (MSc student)
Anna Kuzmina (MSc student)
Ivan Naidenov (MSC student)
Anhelina Yarashenka (MSc student)
Daria Ustinova (BSc student)

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