Alexey Frolov
Titel
Zitiert von
Zitiert von
Jahr
Bounds on the parameters of locally recoverable codes
I Tamo, A Barg, A Frolov
IEEE Transactions on information theory 62 (6), 3070-3083, 2016
912016
Multiple access system for a vector disjunctive channel
DS Osipov, AA Frolov, VV Zyablov
Problems of information Transmission 48 (3), 243-249, 2012
272012
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
252019
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
202020
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
192019
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
152013
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
152010
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
132019
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
132019
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
112017
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
112015
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
102018
Smart sorting in massive MIMO detection
A Ivanov, D Yarotsky, M Stoliarenko, A Frolov
2018 14th International Conference on Wireless and Mobile Computing …, 2018
92018
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
92017
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
92015
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
92014
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
62011
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
52020
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
52017
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
52015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20