default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKirill V. Andreev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]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)- [c16]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 - 2023
- [j5]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) - [c15]Dmitry Artemasov, Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
Soft-Output Deep Neural Network-Based Decoding. GLOBECOM (Workshops) 2023: 1692-1697 - [c14]Dawit Simegn, Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
On the Design of LDPC-Based Error-Reducing Codes. ISWCS 2023: 1-6 - [c13]Dmitry Artemasov, Kirill V. Andreev, Alexey A. Frolov:
On a Unified Deep Neural Network Decoding Architecture. VTC Fall 2023: 1-5 - [i10]Kirill V. Andreev, Daria Ustinova, Alexey A. Frolov:
Unsourced Random Access with the MIMO Receiver: Projection Decoding Analysis. CoRR abs/2303.15395 (2023) - [i9]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) - [i8]Dmitry Artemasov, Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
Soft-Output Deep Neural Network-Based Decoding. CoRR abs/2304.08868 (2023) - [i7]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) - [i6]Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
On the Error-Reducing Properties of Superposition Codes. CoRR abs/2307.13570 (2023) - 2022
- [j4]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) - [i5]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
- [j3]Pavel S. Rybin, Kirill V. Andreev, Victor V. Zyablov:
Error Exponents of LDPC Codes under Low-Complexity Decoding. Entropy 23(2): 253 (2021) - [c12]Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
Reed-Solomon Coded Compressed Sensing for the Unsourced Random Access. ISWCS 2021: 1-5 - [c11]Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
Unsourced Random Access Based on List Recoverable Codes Correcting t Errors. ITW 2021: 1-6 - [c10]Kirill V. Andreev, Alexey A. Frolov:
On Unsourced Random Access for the MIMO Channel. REDUNDANCY 2021: 17-21 - [c9]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
- [j2]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) - [c8]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 - [i4]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
- [c7]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Short-Packet Low-Power Coded Access for Massive MAC. ACSSC 2019: 827-832 - [c6]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 - [c5]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 - [c4]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 - [c3]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 - [i3]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) - [i2]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
- [i1]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) - 2016
- [j1]Kirill V. Andreev, Evgeny Ya. Rubinovich:
Moving observer trajectory control by angular measurements in tracking problem. Autom. Remote. Control. 77(1): 106-129 (2016) - 2012
- [c2]Kirill V. Andreev, Pavel Boyko, Denis N. Fakhriev:
Low resolution radio model for ns-3. SimuTools 2012: 331-336 - 2010
- [c1]Kirill V. Andreev, Pavel Boyko:
Simulation Study of VoIP Performance in IEEE 802.11 Wireless Mesh Networks. MACOM 2010: 139-150
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 22:08 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:
