| Bounds on the parameters of locally recoverable codes I Tamo, A Barg, A Frolov IEEE Transactions on information theory 62 (6), 3070-3083, 2016 | 149 | 2016 |
| Energy efficient coded random access for the wireless uplink SS Kowshik, K Andreev, A Frolov, Y Polyanskiy IEEE Transactions on Communications 68 (8), 4694-4708, 2020 | 82 | 2020 |
| A polar code based unsourced random access for the Gaussian MAC E Marshakov, G Balitskiy, K Andreev, A Frolov 2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall), 1-5, 2019 | 73 | 2019 |
| Energy efficient random access for the quasi-static fading MAC SS Kowshik, K Andreev, A Frolov, Y Polyanskiy 2019 IEEE International Symposium on Information Theory (ISIT), 2768-2772, 2019 | 64 | 2019 |
| A polar code based TIN-SIC scheme for the unsourced random access in the quasi-static fading MAC K Andreev, E Marshakov, A Frolov 2020 IEEE International Symposium on Information Theory (ISIT), 3019-3024, 2020 | 36 | 2020 |
| Achievability bounds for T-fold irregular repetition slotted ALOHA scheme in the Gaussian MAC A Glebov, N Matveev, K Andreev, A Frolov, A Turlikov 2019 IEEE Wireless Communications and Networking Conference (WCNC), 1-6, 2019 | 34 | 2019 |
| Multiple access system for a vector disjunctive channel DS Osipov, AA Frolov, VV Zyablov Problems of information Transmission 48 (3), 243-249, 2012 | 30 | 2012 |
| Average age of information of irregular repetition slotted ALOHA A Munari, A Frolov GLOBECOM 2020-2020 IEEE Global Communications Conference, 1-6, 2020 | 22 | 2020 |
| Short-packet low-power coded access for massive MAC SS Kowshik, K Andreev, A Frolov, Y Polyanskiy 2019 53rd Asilomar Conference on Signals, Systems, and Computers, 827-832, 2019 | 21 | 2019 |
| New bounds and generalizations of locally recoverable codes with availability S Kruglik, K Nazirkhanova, A Frolov IEEE Transactions on Information Theory 65 (7), 4156-4166, 2019 | 19 | 2019 |
| On a multiple-access in a vector disjunctive channel A Frolov, V Zyablov, V Sidorenko, R Fischer 2013 IEEE International Symposium on Information Theory, 211-215, 2013 | 18 | 2013 |
| On LDPC code based massive random-access scheme for the Gaussian multiple access channel A Glebov, L Medova, P Rybin, A Frolov International Conference on Next Generation Wired/Wireless Networking, 162-171, 2018 | 17 | 2018 |
| Smart sorting in massive MIMO detection A Ivanov, D Yarotsky, M Stoliarenko, A Frolov 2018 14th International Conference on Wireless and Mobile Computing …, 2018 | 16 | 2018 |
| Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes AA Frolov, VV Zyablov Problems of Information Transmission 46 (2), 142-159, 2010 | 16 | 2010 |
| Low complexity energy efficient random access scheme for the asynchronous fading MAC K Andreev, SS Kowshik, A Frolov, Y Polyanskiy 2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall), 1-5, 2019 | 15 | 2019 |
| Coded compressed sensing with list recoverable codes for the unsourced random access K Andreev, P Rybin, A Frolov IEEE Transactions on Communications 70 (12), 7886-7898, 2022 | 13 | 2022 |
| On one generalization of LRC codes with availability S Kruglik, M Dudina, V Potapova, A Frolov 2017 IEEE Information Theory Workshop (ITW), 26-30, 2017 | 13 | 2017 |
| Bounds and constructions of codes with all-symbol locality and availability S Kruglik, A Frolov 2017 IEEE International Symposium on Information Theory (ISIT), 1023-1027, 2017 | 13 | 2017 |
| A new coding method for a multiple-access system with a large number of active users A Frolov, V Zyablov 2015 IEEE Information Theory Workshop (ITW), 1-5, 2015 | 13 | 2015 |
| An upper bound on the minimum distance of LDPC codes over GF (q) A Frolov 2015 IEEE International Symposium on Information Theory (ISIT), 2885-2888, 2015 | 11 | 2015 |
Kirill AndreevSkoltech在 skoltech.ru 的电子邮件经过验证
