pavelrybin



Personal Websites

Pavel Rybin

Dr. Pavel Rybin graduated from Moscow state technical university named after Bauman (BMSTU) in 2010 (chair – Computer Science). He received a Ph.D. degree in Physical and Mathematical Sciences from the Institute for Information Transmission Problems n.a A. Kharkevich of the Russian Academy of Sciences (IITP RAS) in 2012. Pavel has been a Senior Researcher at IITP RAS since 2013. Since 2016 he is a Senior Research Scientist at Skolkovo Institute of Science and Technology (Skoltech). Since 2015, he has participated in more than 10 industrial projects of Huawei. Now he is the project leader of the industrial project with Huawei.

His research interests include error-correcting codes, decoding algorithms, complexity theory, and communication systems. He is a recipient of the Russian President Scholarship and laureate of the contest of young scientists for participation in conferences and seasonal schools in the field of computer science of the Dynasty fund. Since 2012 he is the secretary of the Russian chapter of IEEE Information Theory society.

  • 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.

Selected papers:

  1. P. Rybin, K. Andreev, V. Zyablov, Error Exponents of LDPC Codes under Low-Complexity Decoding // Entropy 23, no. 2: 253, 2021.
  2. L. Medova, P. Rybin, I. Sidorenko, On the Performance Slope of Short LDPC codes // The 12th International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT), on-line, October 5-7, 2019, pp. 67-72.
  3. D. Ustinova, P. Rybin, A. Frolov, On the Analysis of T-Fold Coded Slotted ALOHA for a Fixed Error Probability // The 11th International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT), Dublin, Ireland, October 28-30, 2019, pp. 1-5.
  4.  D. Ustinova, A. Glebov, P. Rybin, A. Frolov, Efficient Concatenated Same Codebook Construction for the Random Access Gaussian MAC // 2019 IEEE 90th Vehicular Technology Conference (VTC), Honolulu, HI, USA, September 22-25, 2019, pp. 1-5.
  5. F. Ivanov, P. Rybin, V. Afanassiev, On the Performance of Slotted Vector-Disjunctive Channel // 16th Canadian Workshop on Information Theory (CWIT), Hamilton, Ontario, Canada, June 2-5, 2019, pp. 1-5.
  6. P. Rybin, A. Frolov, On the Decoding Radius Realized by Low-Complexity Decoded Non-Binary Irregular LDPC Codes // 2018 the International Symposium on Information Theory and Its Applications (ISITA), Singapore, October 28-31, 2018, pp. 384-388.
  7. A. Glebov, L. Medova, P. Rybin, A. Frolov, On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel // Internet of Things, Smart Spaces, and Next Generation Networks and Systems. NEW2AN 2018, ruSMART 2018. Lecture Notes in Computer Science, vol 11118, pp. 162-171, 2018.
  8. P. Rybin, A. Frolov, On the Error Exponents of Capacity Approaching Construction of LDPC Code // 2018 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), Moscow, November 5-9, 2018, pp. 197-201.
  9. Frolov A., Rybin P., Ivanov F.  On Iterative LDPC-Based Joint Decoding Scheme for Binary Input Gaussian Multiple Access Channel // In Proc. of the XV International Symposium on Problems of Redundancy in Information and Control Systems (RED), September 26-29, 2016, St. Petersburg, Russia.
  10. Rybin P.S., Zyablov V.V. Asymptotic Bounds on the Decoding Error Probability for Two Ensembles of LDPC Codes // Problems of Information Transmission. 2015. Vol. 51. No. 3. PP. 205-216.
  11. Zhilin I., Rybin P., Zyablov V. High-Rate Codes for High-Reliability Data Transmission // In Proc. of IEEE International Symposium on Information Theory (ISIT). 2015. PP. 256-260.
  12. Rybin P., Zyablov V., On the Upper Bound on Undetected Error Probability for LDPC Code // In Proc. of IEEE International Symposium on Information Theory (ISIT). 2014. PP. 3160-3164.
  13. Rybin P., On the Error-Correcting Capabilities of Low-Complexity Decoded Irregular LDPC Codes // In Proc. of IEEE International Symposium on Information Theory (ISIT). 2014. PP. 3165-3169.
  14. Zyablov V.V., Rybin P.S. Analysis of the relation between properties of LDPC codes and the Tanner graph // Problems of Information Transmission. 2012. Vol. 48. No. 4. PP. 297-323.
  15. Rybin P.S. Thesis on the Asymptotic Estimation of Error-Correcting Capabilities and Decoding Complexity of Binary Low-Density Parity-Check Codes. 2012. (RUS)
  16. Zyablov V.V., Rybin P.S. Estimation of the Exponent of the Decoding Error Probability for a Special Generalized LDPC Code // Journal of Communications Technology and Electronics. 2012. Vol. 57. No. 8. PP. 84-97.
  17. Rybin P., Zyablov V. Asymptotic Estimation of Error Fraction Corrected by Binary LDPC Code // In Proc. of IEEE International Symposium on Information Theory (ISIT). 2011. PP. 351-355.
  18. Zyablov V.V., Rybin P.S. Erasure correction by low-density codes // Problems of Information Transmission. 2009. Vol. 45. No. 3. PP. 204-220.
  19. Zyablov V., Loncar M., Johannesson R., Rybin, P. On the Asymptotic Performance of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes // In Proc. of 5th International Symposium on Turbo Codes and Related Topics. 2008. PP. 174-179.
Ph.D.Physical and Mathematical Sciences Institute for Information Transmission Problems n.a. A. Kharkevich, Russian Academy of Sciences, Moscow, Russia 2010-2012
SpecialistComputer science and control systems Moscow State Technical University n.a. N.E. Bauman, Moscow, Russia 2004-2010

Information theory, coding theory, binary low-density parity-check (LDPC) codes, generalized concatenated code (GCC) constructions, generalized error-locating (GEL) codes, wireless communication, satellite and space communication, optical communication and networking, communication theory, modulations and coding, algorithms and complexity.

  • Russian President Scholarship
  • Laureate of the contest of young scientists for participation in conferences and seasonal schools in the field of computer science of the Dynasty fund
  • Best student paper award for the paper “On the Analysis of T-Fold Coded Slotted ALOHA for a Fixed Error Probability” at the 11th International Congress on Ultra Modern Telecommunications (ICUMT)