Pavel Rybin

Dr. Pavel Rybin

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 October 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
KAKirill Andreev
Kirill Andreev
PRPavel Rybin
Pavel Rybin
AFAlexey Frolov
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. (2020) with the list recoverable code capable of correcting t errors. A finite-length random coding bound for such codes is derived. The numerical experiments in the single-antenna quasi-static Rayleigh fading channel show that transition to list recoverable codes correcting t errors improves the performance of the coded compressed sensing scheme by 7-10 dB compared to the tree code-based scheme. We propose two practical constructions of outer codes. The first is a modification of the tree code called t -tree code. It utilizes the same code structure, and a key difference is a decoder capable of correcting up to t errors. The second is based on the Reed–Solomon codes and Guruswami–Sudan list decoding algorithm. The first scheme provides energy efficiency very close to the random coding bound when the decoding complexity (number of decoding paths) is unbounded. But when we restrict the number of decoding paths with a practical value, the second scheme outperforms the first one. Both schemes improve the performance of a tree code-based scheme for a small and moderate number of active users.

29 September 2018
Verified
Book Chapter
Closed access
PDF file
AGAnton Glebov
Anton Glebov
LMLuiza Medova
Luiza Medova
PRPavel Rybin
Pavel Rybin
AFAlexey Frolov
Alexey Frolov

1 June 2014
Verified
Conference Paper
Closed access
PRPavel Rybin
Pavel Rybin
This paper deals with the irregular binary low-density parity-check (LDPC) codes with the constituent single parity check (SPC) codes and the error-correcting iterative low-complex decoding algorithm. The lower bound on the error fraction, guaranteed corrected by the considered iterative algorithm, was obtained for the irregular LDPC code for the first time in this paper. This lower bound was obtained as a result of analysis of Tanner graph representation of irregular LDPC code. The number of decoding iterations, required to correct the errors, is a logarithmic function of the code length. The numerical results, obtained at the end of the paper for proposed lower bound achieved similar results for the previously known best lower-bounds for regular LDPC codes and were represented for the first time for the irregular LDPC codes.

22 February 2021 in Entropy
Verified
Journal Article
Open access
PDF file
PRPavel Rybin
Pavel Rybin
KAKirill Andreev
Kirill Andreev
VZVictor Zyablov
Victor Zyablov
This paper deals with the specific construction of binary low-density parity-check (LDPC) codes. We derive lower bounds on the error exponents for these codes transmitted over the memoryless binary symmetric channel (BSC) for both the well-known maximum-likelihood (ML) and proposed low-complexity decoding algorithms. We prove the existence of such LDPC codes that the probability of erroneous decoding decreases exponentially with the growth of the code length while keeping coding rates below the corresponding channel capacity. We also show that an obtained error exponent lower bound under ML decoding almost coincide with the error exponents of good linear codes.

3 July 2023 in IEEE Communications Letters
Verified
Journal Article
Closed access
AGAnton Glebov
Anton Glebov
PRPavel Rybin
Pavel Rybin
KAKirill Andreev
Kirill Andreev
AFAlexey Frolov
Alexey Frolov
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 achieve the target per-user probability of error. The original method proposed by Y. Polyanskiy (2017) and based on Gallager’s trick does not work well for binary signaling. We utilize Fano’s method, which is based on the choice of the so-called “good” region. We apply this method for the cases of Gaussian and binary codebooks and obtain two achievability bounds. The first bound is very close to Polyanskiy’s bound but does not lead to any improvement. At the same time, the numerical results show that the bound for the binary case practically coincides with the bound for the Gaussian codebook. Thus, we conclude that energy-efficient schemes using binary modulation do exist.

1 June 2015
Verified
Conference Paper
Closed access
IZIgor Zhilin
Igor Zhilin
PRPavel Rybin
Pavel Rybin
VZVictor Zyablov
Victor Zyablov
In this paper we propose to consider a generalized error-locating code (GEL-code) as a possible candidate for data transmission systems that require high code rates along with strict requirements on wrong decoding probability. GEL codes are one of a few that allow analytical computation of code error probability bounds and have practical construction method. The paper describes the construction of the GEL-code and the algorithms for encoding and decoding. It represents the upper and lower bounds on wrong decoding probability. It gives a method for constructing such GEL code (with the minimal redundancy) that guarantees that the probability of wrong decoding will be less than required one (for a given channel error probability). Numerical results for the upper and lower bounds for the various GEL-codes and the analysis of the energy gain for the different signal-code structures are given.