Mohammad Rowshan

Orcid: 0000-0002-2199-5655

According to our database1, Mohammad Rowshan authored at least 29 papers between 2018 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Weight Structure of Low/High-Rate Polar Codes and Its Applications.
CoRR, 2024

2023
On the Formation of Min-Weight Codewords of Polar/PAC Codes and Its Applications.
IEEE Trans. Inf. Theory, December, 2023

On the Minimum Weight Codewords of PAC Codes: The Impact of Pre-Transformation.
IEEE J. Sel. Areas Inf. Theory, 2023

Segmented GRAND: Combining Sub-patterns in Near-ML Order.
CoRR, 2023

On the Closed-form Weight Enumeration of Polar Codes: 1.5d-weight Codewords.
CoRR, 2023

A Non-uniform Quantization-based Hardware Architecture for BP Decoding of Polar Codes.
Proceedings of the 22nd International Symposium on Communications and Information Technologies, 2023

Rate-Compatible Shortened PAC Codes.
Proceedings of the IEEE/CIC International Conference on Communications in China, 2023

Delay-Doppler Channel Estimation by Leveraging the Ambiguity Function in OFDM Systems.
Proceedings of the IEEE International Conference on Communications, 2023

Low-Complexity GRAND by Segmentation.
Proceedings of the IEEE Global Communications Conference, 2023

Improved Convolutional Precoder for PAC Codes.
Proceedings of the IEEE Global Communications Conference, 2023

2022
Efficient Partial Rewind of Successive Cancellation-Based Decoders for Polar Codes.
IEEE Trans. Commun., 2022

SC List-Flip Decoding of Polar Codes by Shifted Pruning: A General Approach.
Entropy, 2022

Selective Reverse PAC Coding for Sphere Decoding.
CoRR, 2022

Fast Enumeration of Minimum Weight Codewords of PAC Codes.
Proceedings of the IEEE Information Theory Workshop, 2022

Improving the Error Coefficient of Polar Codes.
Proceedings of the IEEE Information Theory Workshop, 2022

Constrained Error Pattern Generation for GRAND.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
List Viterbi Decoding of PAC Codes.
IEEE Trans. Veh. Technol., 2021

Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding.
IEEE Trans. Veh. Technol., 2021

Error Coefficient-reduced Polar/PAC Codes.
CoRR, 2021

Efficient Partial Rewind of Polar Codes' Successive Cancellation-based Decoders for Re-decoding Attempts.
CoRR, 2021

On Convolutional Precoding in PAC Codes.
Proceedings of the IEEE Globecom 2021 Workshops, Madrid, Spain, December 7-11, 2021, 2021

Logarithmic Non-uniform Quantization for List Decoding of Polar Codes.
Proceedings of the 11th IEEE Annual Computing and Communication Workshop and Conference, 2021

Shifted Pruning for Path Recovery in List Decoding of Polar Codes.
Proceedings of the 11th IEEE Annual Computing and Communication Workshop and Conference, 2021

2020
Polarization-adjusted Convolutional (PAC) Codes: Fano Decoding vs List Decoding.
CoRR, 2020

Shifted Pruning for List Decoding of Polar Codes.
CoRR, 2020

Complexity-efficient Fano Decoding of Polarization-adjusted Convolutional (PAC) Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

2019
Improved List Decoding of Polar Codes by Shifted-pruning.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

How to Modify Polar Codes for List Decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Stepped List Decoding for Polar Codes.
Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018


  Loading...