Ruslan Morozov

Orcid: 0000-0003-0077-1246

Affiliations:
  • Bilkent University, Department of Electrical and Electronics Engineering, Ankara, Turkey
  • ITMO University, Faculty of Secure Information Technologies, Saint Petersburg, Russia (PhD)
  • St. Petersburg Polytechnic University, Institute of Computer Science and Technology, Russia (former)


According to our database1, Ruslan Morozov authored at least 14 papers between 2017 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Channels With Markov Synchronization Errors: Information Stability and Capacity Bounds.
IEEE Trans. Commun., 2026

Simple Finite-Length Achievability and Converse Bounds for Deletion and Insertion Channels.
IEEE Trans. Commun., 2026

2025
Simple Finite-Length Achievability and Converse Bounds for the Deletion Channel and the Insertion Channel.
CoRR, April, 2025

Simple Converse Bounds on the Deletion Channel Capacity with Finite Block Lengths.
Proceedings of the IEEE International Symposium on Information Theory, 2025

2024
Shannon Capacity of Channels with Markov Insertions, Deletions and Substitutions.
CoRR, 2024

On the Capacity of Channels with Markov Insertions, Deletions and Substitutions.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2020
Convolutional Polar Kernels.
IEEE Trans. Commun., 2020

Efficient List Decoding of Convolutional Polar Codes.
CoRR, 2020

2019
Successive and Two-Stage Systematic Encoding of Polar Subcodes.
IEEE Wirel. Commun. Lett., 2019

On Distance Properties of Convolutional Polar Codes.
IEEE Trans. Commun., 2019

A Simplified Lower Bound on Minimum Distance of Convolutional Polar Codes.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

A Lower Bound on Minimum Distance of Convolutional Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Efficient SC Decoding of Convolutional Polar Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017
Fast Sequential Decoding of Polar Codes.
CoRR, 2017


  Loading...