| Lower bounds on the lifting degree of QC-LDPC codes by difference matrices F Amirzade, MR Sadeghi IEEE Access 6, 23688-23700, 2018 | 33 | 2018 |
| Analytical lower bound on the lifting degree of multiple-edge QC-LDPC codes with girth 6 MR Sadeghi, F Amirzade IEEE Communications Letters 22 (8), 1528-1531, 2018 | 24 | 2018 |
| Analytical lower bounds on the size of elementary trapping sets of variable-regular LDPC codes with any girth and irregular ones with girth 8 F Amirzade, MR Sadeghi IEEE Transactions on Communications 66 (6), 2313-2321, 2018 | 19 | 2018 |
| Edge-coloring technique to analyze elementary trapping sets of spatially-coupled LDPC convolutional codes MR Sadeghi, F Amirzade IEEE Communications Letters 24 (4), 711-715, 2019 | 14 | 2019 |
| QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field. F Amirzade, MR Sadeghi, D Panario Advances in Mathematics of Communications 14 (3), 2020 | 11 | 2020 |
| Construction of protograph-based LDPC codes with chordless short cycles F Amirzade, MR Sadeghi, D Panario IEEE Transactions on Information Theory, 2023 | 10 | 2023 |
| QC-LDPC codes with large column weight and free of small size ETSs F Amirzade, MR Sadeghi, D Panario IEEE Communications Letters 26 (3), 500-504, 2021 | 10 | 2021 |
| Smallest defining sets of super-simple 2-(v, 4, 1) directed designs N Soltankhah, F Amirzade arXiv preprint arXiv:1205.6395, 2012 | 7 | 2012 |
| Improving asymptotic properties of loop construction of SC-LDPC chains over the BEC AE Dehaghani, MR Sadeghi, F Amirzade IEEE Communications Letters 26 (3), 495-499, 2021 | 5 | 2021 |
| Quasi-cyclic protograph-based raptor-like LDPC codes with girth 6 and shortest length F Amirzade, MR Sadeghi, D Panario 2021 IEEE International Symposium on Information Theory (ISIT), 368-373, 2021 | 5 | 2021 |
| Girth Analysis of Quantum Quasi-Cyclic LDPC Codes F Amirzade, D Panario, MR Sadeghi Problems of Information Transmission 60 (2), 71-89, 2024 | 3 | 2024 |
| Trade-based LDPC codes F Amirzade, D Panario, MR Sadeghi 2022 IEEE International Symposium on Information Theory (ISIT), 542-547, 2022 | 3 | 2022 |
| Super-simple 2-(v; 5; 1) directed designs and their smallest defining sets N Soltankhah, F Amirzade arXiv preprint arXiv:1205.6047, 2012 | 3 | 2012 |
| Protograph-based LDPC codes with chordless short cycles and large minimum distance F Amirzade, MR Sadeghi, D Panario 2022 17th Canadian Workshop on Information Theory (CWIT), 16-20, 2022 | 2 | 2022 |
| An algebraic construction of QC-LDPC codes based on powers of primitive elements in a finite field and free of small ETSs F Amirzade, M Alishahi, MRR Sadeghi J. Algebraic Struct. The. Appl 6, 129-140, 2019 | 2 | 2019 |
| A Neural Network Lattice Decoding Algorithm MR Sadeghi, F Amirzade, D Panario, A Sakzad 2018 IEEE Information Theory Workshop (ITW), 1-5, 2018 | 2 | 2018 |
| Edge coloring technique to remove small elementary trapping sets from tanner graph of QC-LDPC codes with column weight 4 MR Sadeghi, F Amirzade arXiv preprint arXiv:1808.05258, 2018 | 2 | 2018 |
| Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices F Amirzade, MR Sadeghi arXiv preprint arXiv:1709.00825, 2017 | 2 | 2017 |
| Quantum Quasi-cyclic LDPC Codes with Column Weight at Least 3 Have Girth at Most 6 F Amirzade, D Panario, MR Sadeghi Probl. Peredachi Inf. 60 (2), 3-11, 2024 | 1 | 2024 |
| Efficient search of QC-LDPC codes with girths 6 and 8 and free of elementary trapping sets with small size F Amirzade, MR Sadeghi arXiv preprint arXiv:1803.08141, 2018 | 1 | 2018 |
Mohammad-Reza (Rafsanjani) SadeghiProfessor of Department of Mathematics and Computer Science, Amirkabir University of TechnologyAdresse e-mail validée de aut.ac.ir
