default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexey A. Frolov
Person information
- affiliation: Russian Academy of Sciences, Moscow, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Albert Saiapin, Gleb Balitskiy, Daniel Bershatsky, Aleksandr Katrutsa, Evgeny Frolov, Alexey A. Frolov, Ivan V. Oseledets, Vitaliy Kharin:
Federated privacy-preserving collaborative filtering for on-device next app prediction. User Model. User Adapt. Interact. 34(4): 1369-1398 (2024)- [j14]Kirill V. Andreev
, Daria Ustinova, Alexey A. Frolov:
Unsourced Random Access With the MIMO Receiver: Projection Decoding Analysis. IEEE Wirel. Commun. Lett. 13(1): 69-73 (2024) - [c37]Ivan Butakov, Aleksander Tolmachev, Sofia Malanchuk, Anna Neopryatnaya, Alexey A. Frolov, Kirill V. Andreev:
Information Bottleneck Analysis of Deep Neural Networks via Lossy Compression. ICLR 2024 - [i26]Ivan Butakov, Aleksander Tolmachev, Sofia Malanchuk, Anna Neopryatnaya, Alexey A. Frolov:
Mutual Information Estimation via Normalizing Flows. CoRR abs/2403.02187 (2024) - 2023
- [j13]Anton Glebov, Pavel S. Rybin, Kirill V. Andreev, Alexey A. Frolov:
Energy Efficiency of Unsourced Random Access Over the Binary-Input Gaussian Channel. IEEE Commun. Lett. 27(9): 2313-2317 (2023) - [c36]Dmitry Artemasov, Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
Soft-Output Deep Neural Network-Based Decoding. GLOBECOM (Workshops) 2023: 1692-1697 - [c35]Dawit Simegn, Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
On the Design of LDPC-Based Error-Reducing Codes. ISWCS 2023: 1-6 - [c34]Dmitry Artemasov, Kirill V. Andreev, Alexey A. Frolov:
On a Unified Deep Neural Network Decoding Architecture. VTC Fall 2023: 1-5 - [i25]Albert Sayapin, Gleb Balitskiy, Daniel Bershatsky, Aleksandr Katrutsa, Evgeny Frolov, Alexey A. Frolov, Ivan V. Oseledets, Vitaliy Kharin:
Federated Privacy-preserving Collaborative Filtering for On-Device Next App Prediction. CoRR abs/2303.04744 (2023) - [i24]Kirill V. Andreev, Daria Ustinova, Alexey A. Frolov:
Unsourced Random Access with the MIMO Receiver: Projection Decoding Analysis. CoRR abs/2303.15395 (2023) - [i23]Anton Glebov, Pavel S. Rybin, Kirill V. Andreev, Alexey A. Frolov:
Energy Efficiency of Unsourced Random Access over the Binary-Input Gaussian Channel. CoRR abs/2304.02598 (2023) - [i22]Dmitry Artemasov, Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
Soft-Output Deep Neural Network-Based Decoding. CoRR abs/2304.08868 (2023) - [i21]Ivan Butakov, Aleksander Tolmachev, Sofia Malanchuk, Anna Neopryatnaya, Alexey A. Frolov, Kirill V. Andreev:
Information Bottleneck Analysis of Deep Neural Networks via Lossy Compression. CoRR abs/2305.08013 (2023) - [i20]Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
On the Error-Reducing Properties of Superposition Codes. CoRR abs/2307.13570 (2023) - 2022
- [j12]Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
Coded Compressed Sensing With List Recoverable Codes for the Unsourced Random Access. IEEE Trans. Commun. 70(12): 7886-7898 (2022) - [i19]Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
Coded Compressed Sensing with List Recoverable Codes for the Unsourced Random Access. CoRR abs/2201.07695 (2022) - 2021
- [j11]Lukas Holzbaur, Stanislav Kruglik, Alexey A. Frolov, Antonia Wachter-Zeh:
Secure Codes With Accessibility for Distributed Storage. IEEE Trans. Inf. Forensics Secur. 16: 5326-5337 (2021) - [c33]Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
Reed-Solomon Coded Compressed Sensing for the Unsourced Random Access. ISWCS 2021: 1-5 - [c32]Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
Unsourced Random Access Based on List Recoverable Codes Correcting t Errors. ITW 2021: 1-6 - [c31]Kirill V. Andreev, Alexey A. Frolov:
On Unsourced Random Access for the MIMO Channel. REDUNDANCY 2021: 17-21 - [c30]Gleb Balitskiy, Alexey A. Frolov, Pavel S. Rybin:
Linear Programming Decoding of Non-Linear Sparse-Graph Codes. REDUNDANCY 2021: 149-154 - [c29]Kirill V. Andreev, Alexey A. Frolov, German Svistunov, Kedi Wu, Jing Liang:
Deep Neural Network Based Decoding of Short 5G LDPC Codes. REDUNDANCY 2021: 155-160 - 2020
- [j10]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Energy Efficient Coded Random Access for the Wireless Uplink. IEEE Trans. Commun. 68(8): 4694-4708 (2020) - [c28]Lukas Holzbaur, Stanislav Kruglik, Alexey A. Frolov, Antonia Wachter-Zeh:
Secrecy and Accessibility in Distributed Storage. GLOBECOM 2020: 1-6 - [c27]Andrea Munari, Alexey A. Frolov:
Average Age of Information of Irregular Repetition Slotted ALOHA. GLOBECOM 2020: 1-6 - [c26]Kirill V. Andreev, Evgeny Marshakov, Alexey A. Frolov:
A Polar Code Based TIN-SIC Scheme for the Unsourced Random Access in the Quasi-Static Fading MAC. ISIT 2020: 3019-3024 - [c25]Kamilla Nazirkhanova, Luiza R. Medova, Stanislav Kruglik, Alexey A. Frolov:
Codes Correcting Bounded Length Tandem Duplication. ISITA 2020: 299-303 - [i18]Lukas Holzbaur, Stanislav Kruglik, Alexey A. Frolov, Antonia Wachter-Zeh:
Secrecy and Accessibility in Distributed Storage. CoRR abs/2001.05337 (2020) - [i17]Andrea Munari, Alexey A. Frolov:
Average Age of Information ofIrregular Repetition Slotted ALOHA. CoRR abs/2004.01998 (2020) - [i16]Kirill V. Andreev, Evgeny Marshakov, Alexey A. Frolov:
A Polar Code Based TIN-SIC Scheme for the Unsourced Random Access in the Quasi-Static Fading MAC. CoRR abs/2005.06899 (2020)
2010 – 2019
- 2019
- [j9]Stanislav Kruglik, Kamilla Nazirkhanova, Alexey A. Frolov:
New Bounds and Generalizations of Locally Recoverable Codes With Availability. IEEE Trans. Inf. Theory 65(7): 4156-4166 (2019) - [c24]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Short-Packet Low-Power Coded Access for Massive MAC. ACSSC 2019: 827-832 - [c23]Daria Ustinova, Pavel S. Rybin, Alexey A. Frolov:
On the Analysis of T-Fold Coded Slotted ALOHA for a Fixed Error Probability. ICUMT 2019: 1-5 - [c22]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Energy efficient random access for the quasi-static fading MAC. ISIT 2019: 2768-2772 - [c21]Andrei Dzis, Pavel S. Rybin, Alexey A. Frolov:
On the Hard-Decision Multi-Threshold Decoding of Binary and Non-Binary LDPC Codes. REDUNDANCY 2019: 23-26 - [c20]Artem Burkov, Alexey A. Frolov, Pavel S. Rybin, Andrey M. Turlikov:
Achievability Bounds for Massive Random Access in the Gaussian MAC with Delay Constraints. REDUNDANCY 2019: 224-227 - [c19]Kirill V. Andreev, Suhas S. Kowshik, Alexey A. Frolov, Yury Polyanskiy:
Low Complexity Energy Efficient Random Access Scheme for the Asynchronous Fading MAC. VTC Fall 2019: 1-5 - [c18]Stanislav Kruglik, Pavel S. Rybin, Alexey A. Frolov:
On the Secrecy Capacity of Distributed Storage with Locality and Availability. VTC Fall 2019: 1-5 - [c17]Evgeny Marshakov, Gleb Balitskiy, Kirill V. Andreev, Alexey A. Frolov:
A Polar Code Based Unsourced Random Access for the Gaussian MAC. VTC Fall 2019: 1-5 - [c16]Daria Ustinova, Anton Glebov, Pavel S. Rybin, Alexey A. Frolov:
Efficient Concatenated Same Codebook Construction for the Random Access Gaussian MAC. VTC Fall 2019: 1-5 - [c15]Anton Glebov, Nikolay Matveev, Kirill V. Andreev, Alexey A. Frolov, Andrey M. Turlikov:
Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC. WCNC 2019: 1-6 - [i15]Evgeny Marshakov, Gleb Balitskiy, Kirill V. Andreev, Alexey A. Frolov:
Design and Decoding of Polar Codes for the Gaussian Multiple Access Channel. CoRR abs/1901.07297 (2019) - [i14]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Energy efficient coded random access for the wireless uplink. CoRR abs/1907.09448 (2019) - 2018
- [c14]Artem Burkov, Alexey A. Frolov, Andrey M. Turlikov:
Contention-Based Protocol with Time Division Collision Resolution. ICUMT 2018: 1-4 - [c13]Pavel Rvbin, Alexey A. Frolov:
On the Error Exponents of Capacity Approaching Construction of LDPC code. ICUMT 2018: 1-5 - [c12]Stanislav Kruglik, Kamilla Nazirkhanova, Alexey A. Frolov:
On Distance Properties of $(r, t, x)$-LRC Codes. ISIT 2018: 1336-1339 - [c11]Pavel S. Rybin, Alexey A. Frolov:
On the Decoding Radius Realized by Low-Complexity Decoded Non-Binary Irregular LDPC Codes. ISITA 2018: 384-388 - [c10]Anton Glebov, Luiza Medova, Pavel S. Rybin, Alexey A. Frolov:
On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel. NEW2AN 2018: 162-171 - [c9]Andrey Ivanov, Dmitry Yarotsky, Maria Stoliarenko, Alexey A. Frolov:
Smart Sorting in Massive MIMO Detection. WiMob 2018: 1-6 - [i13]Nikolay Matveev, Kirill V. Andreev, Alexey A. Frolov, Andrey M. Turlikov:
Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian Multiple Access Channel. CoRR abs/1802.07332 (2018) - [i12]Luiza Medova, Anton Glebov, Pavel S. Rybin, Alexey A. Frolov:
On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel. CoRR abs/1803.08377 (2018) - 2017
- [j8]Alexey A. Frolov, Victor V. Zyablov:
On the multiple threshold decoding of LDPC codes over GF(q). Adv. Math. Commun. 11(1): 123-137 (2017) - [c8]Stanislav Kruglik, Alexey A. Frolov:
Bounds and constructions of codes with all-symbol locality and availability. ISIT 2017: 1023-1027 - [c7]Stanislav Kruglik, Marina Dudina, Valeriya Potapova, Alexey A. Frolov:
On one generalization of LRC codes with availability. ITW 2017: 26-30 - [i11]Stanislav Kruglik, Alexey A. Frolov:
Bounds and Constructions of Codes with All-Symbol Locality and Availability. CoRR abs/1702.01314 (2017) - [i10]Valeriya Potapova, Alexey A. Frolov:
On Multilevel Coding Schemes Based on Non-Binary LDPC Codes. CoRR abs/1702.02372 (2017) - [i9]Stanislav Kruglik, Valeriya Potapova, Alexey A. Frolov:
A method for constructing parity-check matrices of non-binary quasi-cyclic LDPC codes. CoRR abs/1705.10717 (2017) - [i8]Stanislav Kruglik, Marina Dudina, Valeriya Potapova, Alexey A. Frolov:
On One Generalization of LRC Codes with Availability. CoRR abs/1705.11095 (2017) - 2016
- [j7]Alexey A. Frolov:
Upper bound on the minimum distance of LDPC codes over GF(q) based on counting the number of syndromes. Probl. Inf. Transm. 52(1): 6-13 (2016) - [j6]Itzhak Tamo, Alexander Barg, Alexey A. Frolov:
Bounds on the Parameters of Locally Recoverable Codes. IEEE Trans. Inf. Theory 62(6): 3070-3083 (2016) - 2015
- [c6]Alexey A. Frolov, Victor V. Zyablov:
On the multiple threshold decoding of LDPC codes over GF(q). ISIT 2015: 2673-2677 - [c5]Alexey A. Frolov:
An upper bound on the minimum distance of LDPC codes over GF(q). ISIT 2015: 2885-2888 - [c4]Alexey A. Frolov, Victor V. Zyablov:
A new coding method for a multiple-access system with a large number of active users. ITW 2015: 1-5 - [i7]Alexey A. Frolov, Victor V. Zyablov:
On the Multiple Threshold Decoding of LDPC codes over GF(q). CoRR abs/1502.06871 (2015) - [i6]Alexey A. Frolov:
An Upper Bound on the Minimum Distance of LDPC Codes over GF(q). CoRR abs/1502.06874 (2015) - [i5]Itzhak Tamo, Alexander Barg, Alexey A. Frolov:
Bounds on the Parameters of Locally Recoverable Codes. CoRR abs/1506.07196 (2015) - 2014
- [j5]Alexey A. Frolov, Victor V. Zyablov:
On the capacity of a multiple-access vector adder channel. Probl. Inf. Transm. 50(2): 133-143 (2014) - [i4]Alexey A. Frolov, Pavel S. Rybin, Victor V. Zyablov:
On the Capacity of the Multiuser Vector Adder Channel. CoRR abs/1401.2118 (2014) - [i3]Alexey A. Frolov, Pavel S. Rybin:
Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited. CoRR abs/1401.2120 (2014) - 2013
- [j4]Dmitry S. Osipov, Alexey A. Frolov, Victor V. Zyablov:
On the user capacity for a multiple-access system in a vector disjunctive channel with errors. Probl. Inf. Transm. 49(4): 308-321 (2013) - [c3]Alexey A. Frolov, Victor V. Zyablov, Vladimir Sidorenko, Robert F. H. Fischer:
On a multiple-access in a vector disjunctive channel. ISIT 2013: 211-215 - [c2]Dmitry S. Osipov, Alexey A. Frolov, Victor V. Zyablov:
On the Capacity of a PPM UWB Multiple-Access System with a Single User Noncoherent Reception. WiFlex 2013: 49-57 - [i2]Alexey A. Frolov, Victor V. Zyablov, Vladimir Sidorenko, Robert F. H. Fischer:
On a Multiple-Access in a Vector Disjunctive Channel. CoRR abs/1301.5852 (2013) - 2012
- [j3]Dmitry S. Osipov, Alexey A. Frolov, Victor V. Zyablov:
Multiple access system for a vector disjunctive channel. Probl. Inf. Transm. 48(3): 243-249 (2012) - 2011
- [j2]Alexey A. Frolov, Victor V. Zyablov:
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs. Probl. Inf. Transm. 47(4): 327-341 (2011) - [c1]Alexey A. Frolov, Victor V. Zyablov:
Upper and lower bounds on the minimum distance of expander codes. ISIT 2011: 1397-1401 - [i1]Alexey A. Frolov, Victor V. Zyablov:
Upper and Lower Bounds on the Minimum Distance of Expander Codes. CoRR abs/1105.6224 (2011) - 2010
- [j1]Alexey A. Frolov, Victor V. Zyablov:
Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes. Probl. Inf. Transm. 46(2): 142-159 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
