117 citations · 133 across the 17 of their papers we have counts for
20 papers
A Tutorial on Weight Structure of Polar Codes
Mohamamd Rowshan, Vlad-Florin Dragoi
This tutorial introduces the algebraic foundations underlying the weight structure of polar codes. Using a monomial-based polynomial formalism, we explain how polar and Reed-Muller…
A Hybrid Reliability--Weight Framework for Construction of Polar Codes
Mohammad Rowshan, Vlad-Florin Dragoi
Polar codes are usually constructed by ranking synthetic bit-channels according to reliability, which guarantees capacity-achieving behavior but can yield poor low-weight spectra a…
Generalized Weight Structure of Polar Codes: Selected Template Polynomials
Mohammad Rowshan, Vlad-Florin Dragoi
Polar codes can be viewed as decreasing monomial codes, revealing a rich algebraic structure governed by the lower-triangular affine (LTA) group. We develop a general framework to…
Algebraic Properties of PAC Codes
Vlad-Florin Dragoi, Mohammad Rowshan
We analyze polarization-adjusted convolutional codes using the algebraic representation of polar and Reed-Muller codes. We define a large class of codes, called generalized polynom…
Towards Weight Distribution-Aware Polar Codes
Mohammad Rowshan, Vlad-Florin Dragoi
Polar codes are constructed based on the reliability of sub-channels resulting from the polarization effect. However, this information-theoretic construction approach leads to a po…
On Weight Enumeration and Structure Characterization of Polar Codes via Group Actions
Vlad-Florin Dragoi, Mohammad Rowshan
In this article, we provide a complete characterization of codewords in polar codes with weights less than twice the minimum distance, using the group action of the lower triangula…
PAC Codes Meet CRC-Polar Codes
Xinyi Gu, Mohammad Rowshan, Jinhong Yuan
CRC-Polar codes under SC list decoding are well-regarded for their competitive error performance. This paper examines these codes by focusing on minimum weight codewords, breaking…
Reverse PAC Codes: Look-ahead List Decoding
Xinyi Gu, Mohammad Rowshan, Jinhong Yuan
Convolutional precoding in polarization-adjusted convolutional (PAC) codes is a recently introduced variant of polar codes. It has demonstrated an effective reduction in the number…
Channel Coding Toward 6G: Technical Overview and Outlook
Mohammad Rowshan, Min Qiu, Yixuan Xie +2
Channel coding plays a pivotal role in ensuring reliable communication over wireless channels. With the growing need for ultra-reliable communication in emerging wireless use cases…
Weight Structure of Low/High-Rate Polar Codes and Its Applications
Mohammad Rowshan, Vlad-Florin Drăgoi, Jinhong Yuan
The structure of a linear block code is pivotal in defining fundamental properties, particularly weight distribution, and code design. In this study, we characterize the Type II st…
On the Closed-form Weight Enumeration of Polar Codes: 1.5-weight Codewords
Mohammad Rowshan, Vlad-Florin Drăgoi, Jinhong Yuan
The weight distribution of error correction codes is a critical determinant of their error-correcting performance, making enumeration of utmost importance. In the case of polar cod…
Segmented GRAND: Complexity Reduction through Sub-Pattern Combination
Mohammad Rowshan, Jinhong Yuan
The ordered-reliability bits (ORB) variant of guessing random additive noise decoding (GRAND), known as ORBGRAND, achieves remarkably low time complexity at high code rates compare…
Selective Reverse PAC Coding for Sphere Decoding
Xinyi Gu, Mohammad Rowshan, Jinhong Yuan
Convolutional precoding in polarization-adjusted convolutional (PAC) codes can reduce the number of minimum weight codewords (a.k.a error coefficient) of polar codes. This can resu…
Constrained Error Pattern Generation for GRAND
Mohammad Rowshan, Jinhong Yuan
Maximum-likelihood (ML) decoding can be used to obtain the optimal performance of error correction codes. However, the size of the search space and consequently the decoding comple…
On the Formation of Min-weight Codewords of Polar/PAC Codes and Its Applications
Mohammad Rowshan, Son Hoang Dau, Emanuele Viterbo
Minimum weight codewords play a crucial role in the error correction performance of a linear block code. In this work, we establish an explicit construction for these codewords of…
Efficient Partial Rewind of Polar Codes' Successive Cancellation-based Decoders for Re-decoding Attempts
Mohammad Rowshan, Emanuele Viterbo
Successive cancellation (SC) process is an essential component of various decoding algorithms used for polar codes and their variants. Rewinding this process seems trivial if we ha…
On Convolutional Precoding in PAC Codes
Mohammad Rowshan, Emanuele Viterbo
Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a precoding step before the polar transfor…
List Viterbi Decoding of PAC Codes
Mohammad Rowshan, Emanuele Viterbo
Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a pre-coding step before the polar transfo…
PAC Codes: Sequential Decoding vs List Decoding
Mohammad Rowshan, Andreas Burg, Emanuele Viterbo
In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Arıkan proposed to employ a one-to-one convolutional transform as a pre-coding step before…
Shifted Pruning for List Decoding of Polar Codes
Mohammad Rowshan, Emanuele Viterbo
In successive cancellation list (SCL) decoding, the tree pruning operation retains the L best paths with respect to metric at every decoding step. However, the correct path might b…