4 citations · 5 across the 9 of their papers we have counts for
9 papers
A Log-Domain Approximation of SOCS Decoding for Turbo Product Codes
Oleg Nesterenkov, Kirill Andreev, Alexey Frolov +1
This paper studies low-complexity soft-output decoding of turbo product codes with extended Bose--Chaudhuri--Hocquenghem component codes. Recent soft-output from covered space (SOC…
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…
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…
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…
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.…
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…