Pavel S. Rybin

Orcid: 0000-0002-8255-2161

Affiliations:
  • Russian Academy of Sciences, Moscow, Kharkevich Institute


According to our database1, Pavel S. Rybin authored at least 33 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Energy Efficiency of Unsourced Random Access Over the Binary-Input Gaussian Channel.
IEEE Commun. Lett., September, 2023

On the Error-Reducing Properties of Superposition Codes.
CoRR, 2023

Soft-Output Deep Neural Network-Based Decoding.
Proceedings of the IEEE Globecom Workshops 2023, 2023

2022
Coded Compressed Sensing With List Recoverable Codes for the Unsourced Random Access.
IEEE Trans. Commun., 2022

2021
Error Exponents of LDPC Codes under Low-Complexity Decoding.
Entropy, 2021

Linear Programming Decoding of Non-Linear Sparse-Graph Codes.
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

Unsourced Random Access Based on List Recoverable Codes Correcting t Errors.
Proceedings of the IEEE Information Theory Workshop, 2021

Reed-Solomon Coded Compressed Sensing for the Unsourced Random Access.
Proceedings of the 17th International Symposium on Wireless Communication Systems, 2021

2020
On the performance slope of short LDPC codes.
Proceedings of the 12th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2020

2019
Efficient Concatenated Same Codebook Construction for the Random Access Gaussian MAC.
Proceedings of the 90th IEEE Vehicular Technology Conference, 2019

On the Secrecy Capacity of Distributed Storage with Locality and Availability.
Proceedings of the 90th IEEE Vehicular Technology Conference, 2019

On the performance analysis of short LDPC codes.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

On the Capacity Estimation of a Slotted Multiuser Communication Channel with Noise.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

On the Hard-Decision Multi-Threshold Decoding of Binary and Non-Binary LDPC Codes.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

Achievability Bounds for Massive Random Access in the Gaussian MAC with Delay Constraints.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

On the Analysis of T-Fold Coded Slotted ALOHA for a Fixed Error Probability.
Proceedings of the 11th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2019

On the Capacity Estimation of a Slotted Multiuser Communication Channel.
Proceedings of the 11th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2019

On the Performance of Slotted Vector-Disjunctive Channel.
Proceedings of the 16th Canadian Workshop on Information Theory, 2019

On the Asymptotic Capacity of Slotted Multiple Access Channel.
Proceedings of the 2019 International Conference on Computer, 2019

2018
On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel.
Proceedings of the Internet of Things, Smart Spaces, and Next Generation Networks and Systems, 2018

On the Decoding Radius Realized by Low-Complexity Decoded Non-Binary Irregular LDPC Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Novel Signal-Code Construction for Multiple Access System over Vector-Disjunctive Channel.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Signal-Code Construction Based on Interleaved Reed-Solomon Codes for Multiple Access System over Vector-Disjunctive Channel.
Proceedings of the 2018 IEEE International Conference on Communications Workshops, 2018

On the Maximal Achievable Rate for Signal-Code Construction Based on Interleaved Reed-Solomon Codes for Multiple Access System Over Vector-Disjunctive Channel.
Proceedings of the 2018 IEEE International Black Sea Conference on Communications and Networking, 2018

2015
Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes.
Probl. Inf. Transm., 2015

High-rate codes for high-reliability data transmission.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
On the Capacity of the Multiuser Vector Adder Channel.
CoRR, 2014

Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited.
CoRR, 2014

On the upper bound on undetected error probability for LDPC code.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the error-correcting capabilities of low-complexity decoded irregular LDPC codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2012
Analysis of the relation between properties of LDPC codes and the tanner graph.
Probl. Inf. Transm., 2012

2011
Asymptotic estimation of error fraction corrected by binary LDPC code.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2009
Erasure correction by low-density codes.
Probl. Inf. Transm., 2009


  Loading...