11 citations · 22 across the 22 of their papers we have counts for
26 papers
Unsourced Random Access
Kirill Andreev, Pavel Rybin, Alexey Frolov
Current wireless networks are designed to optimize spectral efficiency for human users, who typically require sustained connections for high-data-rate applications like file transf…
On the Error-Reducing Properties of Superposition Codes
Kirill Andreev, Pavel Rybin, Alexey Frolov
Next-generation wireless communication systems impose much stricter requirements for transmission rate, latency, and reliability. The peak data rate of 6G networks should be no les…
Information Bottleneck Analysis of Deep Neural Networks via Lossy Compression
Ivan Butakov, Alexander Tolmachev, Sofia Malanchuk +3
The Information Bottleneck (IB) principle offers an information-theoretic framework for analyzing the training process of deep neural networks (DNNs). Its essence lies in tracking…
Soft-Output Deep Neural Network-Based Decoding
Dmitry Artemasov, Kirill Andreev, Pavel Rybin +1
Deep neural network (DNN)-based channel decoding is widely considered in the literature. The existing solutions are investigated for the case of hard output, i.e. when the decoder…
Energy Efficiency of Unsourced Random Access over the Binary-Input Gaussian Channel
Anton Glebov, Pavel Rybin, Kirill Andreev +1
We investigate the fundamental limits of the unsourced random access over the binary-input Gaussian channel. By fundamental limits, we mean the minimal energy per bit required to a…
Unsourced Random Access with the MIMO Receiver: Projection Decoding Analysis
Kirill Andreev, Daria Ustinova, Alexey Frolov
We consider unsourced random access with MIMO receiver - a crucial communication scenario for future 5G/6G wireless networks. We perform a projection-based decoder analysis and der…
Federated Privacy-preserving Collaborative Filtering for On-Device Next App Prediction
Albert Sayapin, Gleb Balitskiy, Daniel Bershatsky +5
In this study, we propose a novel SeqMF model to solve the problem of predicting the next app launch during mobile device usage. Although this problem can be represented as a class…
Coded Compressed Sensing with List Recoverable Codes for the Unsourced Random Access
Kirill Andreev, Pavel Rybin, Alexey Frolov
We consider a coded compressed sensing approach for the unsourced random access and replace the outer tree code proposed by Amalladinne et al. with the list recoverable code capabl…
Average Age of Information of Irregular Repetition Slotted ALOHA
Andrea Munari, Alexey Frolov
Flanking traditional metrics such as throughput and reliability, age of information (AoI) is emerging as a fundamental tool to capture the performance of IoT systems. In this conte…
A Polar Code Based TIN-SIC Scheme for the Unsourced Random Access in the Quasi-Static Fading MAC
Kirill Andreev, Evgeny Marshakov, Alexey Frolov
We consider a problem of unsourced random access in the quasi-static Rayleigh fading channel. In the previous work, the authors have proposed LDPC code based solutions based on joi…
Secrecy and Accessibility in Distributed Storage
Lukas Holzbaur, Stanislav Kruglik, Alexey Frolov +1
A distributed storage system (DSS) needs to be efficiently accessible and repairable. Recently, considerable effort has been made towards the latter, while the former is usually no…
Energy efficient coded random access for the wireless uplink
Suhas S Kowshik, Kirill Andreev, Alexey Frolov +1
We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically…
Design and Decoding of Polar Codes for the Gaussian Multiple Access Channel
Evgeny Marshakov, Gleb Balitskiy, Kirill Andreev +1
Massive machine-type communications (mMTC) is one of the key application scenarios for future 5G networks. Non-orthogonal multiple access (NOMA) is a promising technique for the us…
On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel
Luiza Medova, Anton Glebov, Pavel Rybin +1
This paper deals with the problem of massive random access for Gaussian multiple access channel (MAC). We continue to investigate the coding scheme for Gaussian MAC proposed by A.…
Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC
Anton Glebov, Nikolay Matveev, Kirill Andreev +2
We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted A…
On One Generalization of LRC Codes with Availability
Stanislav Kruglik, Marina Dudina, Valeriya Potapova +1
We investigate one possible generalization of locally recoverable codes (LRC) with all-symbol locality and availability when recovering sets can intersect in a small number of coor…
A method for constructing parity-check matrices of non-binary quasi-cyclic LDPC codes
Stanislav Kruglik, Valeriya Potapova, Alexey Frolov
An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base…
On Multilevel Coding Schemes Based on Non-Binary LDPC Codes
Valeriya Potapova, Alexey Frolov
We address the problem of constructing of coding schemes for the channels with high-order modulations. It is known, that non-binary LDPC codes are especially good for such channels…
Bounds and Constructions of Codes with All-Symbol Locality and Availability
Stanislav Kruglik, Alexey Frolov
We investigate the distance properties of linear locally recoverable codes (LRC codes) with all-symbol locality and availability. New upper and lower bounds on the minimum distance…
Bounds on the Parameters of Locally Recoverable Codes
Itzhak Tamo, Alexander Barg, Alexey Frolov
A locally recoverable code (LRC code) is a code over a finite alphabet such that every symbol in the encoding is a function of a small number of other symbols that form a recoverin…
An Upper Bound on the Minimum Distance of LDPC Codes over GF(q)
Alexey Frolov
In [1] a syndrome counting based upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to the case of irregular and generaliz…
On the Multiple Threshold Decoding of LDPC codes over GF(q)
Alexey Frolov, Victor Zyablov
We consider the decoding of LDPC codes over GF(q) with the low-complexity majority algorithm from [1]. A modification of this algorithm with multiple thresholds is suggested. A low…
Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited
Alexey Frolov, Pavel Rybin
Two upper bounds on the minimum distance of type-1 quasi-cyclic low-density parity-check (QC LDPC) codes are derived. The necessary condition is given for the minimum code distance…
On the Capacity of the Multiuser Vector Adder Channel
Alexey Frolov, Pavel Rybin, Victor Zyablov
We investigate the capacity of the -frequency -user vector adder channel (channel with intensity information) introduced by Chang and Wolf. Both coordinated and uncoordinated…