Alexey Frolov
Alexey Frolov
Подтвержден адрес электронной почты в домене skoltech.ru - Главная страница
НазваниеПроцитированоГод
Bounds on the parameters of locally recoverable codes
I Tamo, A Barg, A Frolov
IEEE Transactions on information theory 62 (6), 3070-3083, 2016
632016
Multiple access system for a vector disjunctive channel
DS Osipov, AA Frolov, VV Zyablov
Problems of information Transmission 48 (3), 243-249, 2012
222012
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
122010
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
112013
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
92015
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
82017
A coding technique for Q-frequency S-user gaussian channel
AA Frolov, VV Zyablov
Journal of Communications Technology and Electronics 59 (12), 1483-1488, 2014
82014
On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel
A Glebov, L Medova, P Rybin, A Frolov
Internet of Things, Smart Spaces, and Next Generation Networks and Systems …, 2018
62018
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
62017
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
62015
On the capacity of a multiple-access vector adder channel
AA Frolov, VV Zyablov
Problems of Information Transmission 50 (2), 133-143, 2014
42014
On the user capacity for a multiple-access system in a vector disjunctive channel with errors
DS Osipov, AA Frolov, VV Zyablov
Problems of information Transmission 49 (4), 308-321, 2013
42013
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
AA Frolov, VV Zyablov
Problems of Information Transmission 47 (4), 327-341, 2011
42011
Energy efficient random access for the quasi-static fading MAC
S Kowshik, K Andreev, A Frolov, Y Polyanskiy
IEEE International Symposium on Information Theory-Proceedings, 2019
32019
On the multiple threshold decoding of LDPC codes over GF(q)
A Frolov, V Zyablov
Advances in Mathematics of Communications 11 (1), 123-137, 2017
32017
On the Multiple Threshold Decoding of LDPC codes over GF (q)
A Frolov, V Zyablov
Information Theory (ISIT), 2015 IEEE International Symposium on, 2673-2677, 2015
32015
On the capacity of a PPM UWB multiple-access system with a single user noncoherent reception
D Osipov, A Frolov, V Zyablov
International Workshop on Wireless Access Flexibility, 49-57, 2013
32013
A signal-code construction for a multiple-access system using a vector channel with an additive white Gaussian noise
VV Zyablov, AA Frolov
Journal of Communications Technology and Electronics 57 (8), 953-957, 2012
32012
Upper and lower bounds on the minimum distance of expander codes
A Frolov, V Zyablov
2011 IEEE International Symposium on Information Theory Proceedings, 1397-1401, 2011
32011
Energy efficient coded random access for the wireless uplink
SS Kowshik, K Andreev, A Frolov, Y Polyanskiy
arXiv preprint arXiv:1907.09448, 2019
22019
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20