Alexey A. Frolov

Orcid: 0000-0002-6734-0179

Affiliations:
  • Russian Academy of Sciences, Moscow, Russia


According to our database1, Alexey A. Frolov authored at least 59 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Unsourced Random Access With the MIMO Receiver: Projection Decoding Analysis.
IEEE Wirel. Commun. Lett., January, 2024

Mutual Information Estimation via Normalizing Flows.
CoRR, 2024

2023
Energy Efficiency of Unsourced Random Access Over the Binary-Input Gaussian Channel.
IEEE Commun. Lett., September, 2023

On the Error-Reducing Properties of Superposition Codes.
CoRR, 2023

Information Bottleneck Analysis of Deep Neural Networks via Lossy Compression.
CoRR, 2023

Federated Privacy-preserving Collaborative Filtering for On-Device Next App Prediction.
CoRR, 2023

On a Unified Deep Neural Network Decoding Architecture.
Proceedings of the 98th IEEE Vehicular Technology Conference, 2023

Soft-Output Deep Neural Network-Based Decoding.
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
Secure Codes With Accessibility for Distributed Storage.
IEEE Trans. Inf. Forensics Secur., 2021

Linear Programming Decoding of Non-Linear Sparse-Graph Codes.
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

Deep Neural Network Based Decoding of Short 5G LDPC Codes.
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

On Unsourced Random Access for the MIMO Channel.
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

Unsourced Random Access Based on List Recoverable Codes Correcting t Errors.
Proceedings of the IEEE Information Theory Workshop, 2021

Reed-Solomon Coded Compressed Sensing for the Unsourced Random Access.
Proceedings of the 17th International Symposium on Wireless Communication Systems, 2021

2020
Energy Efficient Coded Random Access for the Wireless Uplink.
IEEE Trans. Commun., 2020

Average Age of Information ofIrregular Repetition Slotted ALOHA.
CoRR, 2020

Codes Correcting Bounded Length Tandem Duplication.
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

Average Age of Information of Irregular Repetition Slotted ALOHA.
Proceedings of the IEEE Global Communications Conference, 2020

Secrecy and Accessibility in Distributed Storage.
Proceedings of the IEEE Global Communications Conference, 2020

2019
New Bounds and Generalizations of Locally Recoverable Codes With Availability.
IEEE Trans. Inf. Theory, 2019

Design and Decoding of Polar Codes for the Gaussian Multiple Access Channel.
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

A Polar Code Based Unsourced Random Access for the Gaussian MAC.
Proceedings of the 90th IEEE Vehicular Technology Conference, 2019

On the Secrecy Capacity of Distributed Storage with Locality and Availability.
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

On the Hard-Decision Multi-Threshold Decoding of Binary and Non-Binary LDPC Codes.
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

Energy efficient random access for the quasi-static fading MAC.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Analysis of T-Fold Coded Slotted ALOHA for a Fixed Error Probability.
Proceedings of the 11th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2019

Short-Packet Low-Power Coded Access for Massive MAC.
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

Smart Sorting in Massive MIMO Detection.
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

On Distance Properties of $(r, t, x)$-LRC Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

On the Error Exponents of Capacity Approaching Construction of LDPC code.
Proceedings of the 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2018

Contention-Based Protocol with Time Division Collision Resolution.
Proceedings of the 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2018

2017
On Multilevel Coding Schemes Based on Non-Binary LDPC Codes.
CoRR, 2017

A method for constructing parity-check matrices of non-binary quasi-cyclic LDPC codes.
CoRR, 2017

On the multiple threshold decoding of LDPC codes over GF(q).
Adv. Math. Commun., 2017

On one generalization of LRC codes with availability.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Bounds and constructions of codes with all-symbol locality and availability.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Bounds on the Parameters of Locally Recoverable Codes.
IEEE Trans. Inf. Theory, 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

An upper bound on the minimum distance of LDPC codes over GF(q).
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
On the capacity of a multiple-access vector adder channel.
Probl. Inf. Transm., 2014

On the Capacity of the Multiuser Vector Adder Channel.
CoRR, 2014

Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited.
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

On a multiple-access in a vector disjunctive channel.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Multiple access system for a vector disjunctive channel.
Probl. Inf. Transm., 2012

2011
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs.
Probl. Inf. Transm., 2011

Upper and lower bounds on the minimum distance of expander codes.
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


  Loading...