Alexey A. Frolov
Orcid: 0000-0002-6734-0179Affiliations:
- Russian Academy of Sciences, Moscow, Russia
According to our database1,
Alexey A. Frolov
authored at least 63 papers
between 2010 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2010
2012
2014
2016
2018
2020
2022
2024
0
5
10
1
5
2
1
1
2
2
1
3
2
3
1
1
1
1
1
3
5
4
10
6
2
2
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
On csauthors.net:
Bibliography
2025
IEEE Open J. Commun. Soc., 2025
2024
Federated privacy-preserving collaborative filtering for on-device next app prediction.
User Model. User Adapt. Interact., September, 2024
IEEE Wirel. Commun. Lett., January, 2024
CoRR, 2024
Closed-Form Expressions for LoS User Localization at an Uniform Linear Array Applicable to Both Near-Field and Far-Field.
IEEE Access, 2024
Proceedings of the Twelfth International Conference on Learning Representations, 2024
2023
IEEE Commun. Lett., September, 2023
Proceedings of the 98th IEEE Vehicular Technology Conference, 2023
Proceedings of the 19th International Symposium on Wireless Communication Systems, 2023
Proceedings of the IEEE Globecom Workshops 2023, 2023
2022
Coded Compressed Sensing With List Recoverable Codes for the Unsourced Random Access.
IEEE Trans. Commun., 2022
2021
IEEE Trans. Inf. Forensics Secur., 2021
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021
Proceedings of the IEEE Information Theory Workshop, 2021
Proceedings of the 17th International Symposium on Wireless Communication Systems, 2021
2020
IEEE Trans. Commun., 2020
Proceedings of the International Symposium on Information Theory and Its Applications, 2020
A Polar Code Based TIN-SIC Scheme for the Unsourced Random Access in the Quasi-Static Fading MAC.
Proceedings of the IEEE International Symposium on Information Theory, 2020
Proceedings of the IEEE Global Communications Conference, 2020
Proceedings of the IEEE Global Communications Conference, 2020
2019
IEEE Trans. Inf. Theory, 2019
CoRR, 2019
Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC.
Proceedings of the 2019 IEEE Wireless Communications and Networking Conference, 2019
Efficient Concatenated Same Codebook Construction for the Random Access Gaussian MAC.
Proceedings of the 90th IEEE Vehicular Technology Conference, 2019
Proceedings of the 90th IEEE Vehicular Technology Conference, 2019
Proceedings of the 90th IEEE Vehicular Technology Conference, 2019
Low Complexity Energy Efficient Random Access Scheme for the Asynchronous Fading MAC.
Proceedings of the 90th IEEE Vehicular Technology Conference, 2019
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019
Achievability Bounds for Massive Random Access in the Gaussian MAC with Delay Constraints.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019
Proceedings of the IEEE International Symposium on Information Theory, 2019
Proceedings of the 11th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2019
Proceedings of the 53rd Asilomar Conference on Signals, Systems, and Computers, 2019
2018
Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian Multiple Access Channel.
CoRR, 2018
Proceedings of the 14th International Conference on Wireless and Mobile Computing, 2018
On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel.
Proceedings of the Internet of Things, Smart Spaces, and Next Generation Networks and Systems, 2018
On the Decoding Radius Realized by Low-Complexity Decoded Non-Binary Irregular LDPC Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
Proceedings of the 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2018
Proceedings of the 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2018
2017
A method for constructing parity-check matrices of non-binary quasi-cyclic LDPC codes.
CoRR, 2017
Adv. Math. Commun., 2017
Proceedings of the 2017 IEEE Information Theory Workshop, 2017
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
2016
Upper bound on the minimum distance of LDPC codes over <i>GF</i>(<i>q</i>) based on counting the number of syndromes.
Probl. Inf. Transm., 2016
2015
A new coding method for a multiple-access system with a large number of active users.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015
Proceedings of the IEEE International Symposium on Information Theory, 2015
2014
CoRR, 2014
2013
On the user capacity for a multiple-access system in a vector disjunctive channel with errors.
Probl. Inf. Transm., 2013
On the Capacity of a PPM UWB Multiple-Access System with a Single User Noncoherent Reception.
Proceedings of the Wireless Access Flexibility - First International Workshop, 2013
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
2012
2011
Probl. Inf. Transm., 2011
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
2010
Asymptotic estimation of the fraction of errors correctable by <i>q</i>-ary LDPC codes.
Probl. Inf. Transm., 2010