default search action
Mohammad Rowshan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Mohammad Rowshan, Min Qiu, Yixuan Xie, Xinyi Gu, Jinhong Yuan:
Channel Coding Toward 6G: Technical Overview and Outlook. IEEE Open J. Commun. Soc. 5: 2585-2685 (2024) - [c17]Xinyi Gu, Mohammad Rowshan, Jinhong Yuan:
Reverse PAC Codes: Look-Ahead List Decoding. ISIT 2024: 2844-2849 - [c16]Mohammad Rowshan, Vlad-Florin Dragoi, Jinhong Yuan:
Weight Structure of Low/High-Rate Polar Codes and Its Applications. ISIT 2024: 2945-2950 - [i13]Mohammad Rowshan, Vlad-Florin Dragoi, Jinhong Yuan:
Weight Structure of Low/High-Rate Polar Codes and Its Applications. CoRR abs/2402.12707 (2024) - [i12]Mohammad Rowshan, Min Qiu, Yixuan Xie, Xinyi Gu, Jinhong Yuan:
Channel Coding Toward 6G: Technical Overview and Outlook. CoRR abs/2405.07547 (2024) - [i11]Xinyi Gu, Mohammad Rowshan, Jinhong Yuan:
Reverse PAC Codes: Look-ahead List Decoding. CoRR abs/2406.01903 (2024) - 2023
- [j6]Mohammad Rowshan, Jinhong Yuan:
On the Minimum Weight Codewords of PAC Codes: The Impact of Pre-Transformation. IEEE J. Sel. Areas Inf. Theory 4: 487-498 (2023) - [j5]Mohammad Rowshan, Son Hoang Dau, Emanuele Viterbo:
On the Formation of Min-Weight Codewords of Polar/PAC Codes and Its Applications. IEEE Trans. Inf. Theory 69(12): 7627-7649 (2023) - [c15]Xinyi Gu, Mohammad Rowshan, Jinhong Yuan:
Improved Convolutional Precoder for PAC Codes. GLOBECOM 2023: 1836-1841 - [c14]Mohammad Rowshan, Jinhong Yuan:
Low-Complexity GRAND by Segmentation. GLOBECOM 2023: 6145-6151 - [c13]Hamish P. H. Shaw, Jinhong Yuan, Mohammad Rowshan:
Delay-Doppler Channel Estimation by Leveraging the Ambiguity Function in OFDM Systems. ICC Workshops 2023: 307-313 - [c12]Xinyi Gu, Mohammad Rowshan, Jinhong Yuan:
Rate-Compatible Shortened PAC Codes. ICCC Workshops 2023: 1-6 - [c11]Xinyi Gu, Mohammad Rowshan, Yixuan Xie, Jinhong Yuan:
A Non-uniform Quantization-based Hardware Architecture for BP Decoding of Polar Codes. ISCIT 2023: 363-368 - [i10]Mohammad Rowshan, Vlad-Florin Dragoi, Jinhong Yuan:
On the Closed-form Weight Enumeration of Polar Codes: 1.5d-weight Codewords. CoRR abs/2305.02921 (2023) - [i9]Mohammad Rowshan, Jinhong Yuan:
Segmented GRAND: Combining Sub-patterns in Near-ML Order. CoRR abs/2305.14892 (2023) - 2022
- [j4]Mohammad Rowshan, Emanuele Viterbo:
SC List-Flip Decoding of Polar Codes by Shifted Pruning: A General Approach. Entropy 24(9): 1210 (2022) - [j3]Mohammad Rowshan, Emanuele Viterbo:
Efficient Partial Rewind of Successive Cancellation-Based Decoders for Polar Codes. IEEE Trans. Commun. 70(11): 7160-7168 (2022) - [c10]Mohammad Rowshan, Jinhong Yuan:
Constrained Error Pattern Generation for GRAND. ISIT 2022: 1767-1772 - [c9]Mohammad Rowshan, Son Hoang Dau, Emanuele Viterbo:
Improving the Error Coefficient of Polar Codes. ITW 2022: 249-254 - [c8]Mohammad Rowshan, Jinhong Yuan:
Fast Enumeration of Minimum Weight Codewords of PAC Codes. ITW 2022: 255-260 - [i8]Mohammad Rowshan, Jinhong Yuan:
Constrained Error Pattern Generation for GRAND. CoRR abs/2205.11773 (2022) - [i7]Xinyi Gu, Mohammad Rowshan, Jinhong Yuan:
Selective Reverse PAC Coding for Sphere Decoding. CoRR abs/2212.00254 (2022) - 2021
- [j2]Mohammad Rowshan, Andreas Burg, Emanuele Viterbo:
Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding. IEEE Trans. Veh. Technol. 70(2): 1434-1447 (2021) - [j1]Mohammad Rowshan, Emanuele Viterbo:
List Viterbi Decoding of PAC Codes. IEEE Trans. Veh. Technol. 70(3): 2428-2435 (2021) - [c7]Mohammad Rowshan, Emanuele Viterbo, Rino Micheloni, Alessia Marelli:
Logarithmic Non-uniform Quantization for List Decoding of Polar Codes. CCWC 2021: 1161-1166 - [c6]Mohammad Rowshan, Emanuele Viterbo:
Shifted Pruning for Path Recovery in List Decoding of Polar Codes. CCWC 2021: 1179-1184 - [c5]Mohammad Rowshan, Emanuele Viterbo:
On Convolutional Precoding in PAC Codes. GLOBECOM (Workshops) 2021: 1-6 - [i6]Mohammad Rowshan, Emanuele Viterbo:
On Convolutional Precoding in PAC Codes. CoRR abs/2103.12483 (2021) - [i5]Mohammad Rowshan, Emanuele Viterbo:
Efficient Partial Rewind of Polar Codes' Successive Cancellation-based Decoders for Re-decoding Attempts. CoRR abs/2109.10466 (2021) - [i4]Mohammad Rowshan, Son Hoang Dau, Emanuele Viterbo:
Error Coefficient-reduced Polar/PAC Codes. CoRR abs/2111.08843 (2021) - 2020
- [c4]Mohammad Rowshan, Andreas Burg, Emanuele Viterbo:
Complexity-efficient Fano Decoding of Polarization-adjusted Convolutional (PAC) Codes. ISITA 2020: 200-204 - [i3]Mohammad Rowshan, Emanuele Viterbo:
Shifted Pruning for List Decoding of Polar Codes. CoRR abs/2001.10732 (2020) - [i2]Mohammad Rowshan, Andreas Burg, Emanuele Viterbo:
Polarization-adjusted Convolutional (PAC) Codes: Fano Decoding vs List Decoding. CoRR abs/2002.06805 (2020) - [i1]Mohammad Rowshan, Emanuele Viterbo:
List Viterbi Decoding of PAC Codes. CoRR abs/2007.05353 (2020)
2010 – 2019
- 2019
- [c3]Mohammad Rowshan, Emanuele Viterbo:
How to Modify Polar Codes for List Decoding. ISIT 2019: 1772-1776 - [c2]Mohammad Rowshan, Emanuele Viterbo:
Improved List Decoding of Polar Codes by Shifted-pruning. ITW 2019: 1-5 - 2018
- [c1]Mohammad Rowshan, Emanuele Viterbo:
Stepped List Decoding for Polar Codes. ISTC 2018: 1-5
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-12 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint