Mohammad-Reza Sadeghi

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 55

Top Topics

Asymptotic Properties

Top Venues

IEEE Commun. Lett.

IEEE Trans. Commun.

IEEE Trans. Inf. Theory

Publications

Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario
Disjoint Difference Sets and QC-LDPC Codes With Girth 10. IWCIT (2024)
Malihe Aliasgari, Daniel Panario, Mohammad-Reza Sadeghi
Linear label code of a root lattice using Gröbner bases. Appl. Algebra Eng. Commun. Comput. 35 (1) (2024)
Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario
Construction of Protograph-Based LDPC Codes With Chordless Short Cycles. IEEE Trans. Inf. Theory 70 (1) (2024)
Hassan Noghrei, Mohammad-Reza Sadeghi, Wai Ho Mow
Efficient Active Deep Decoding of Linear Codes using Importance Sampling. CoRR (2023)
Mohammad Ali, Mohammad-Reza Sadeghi, Ximeng Liu, Athanasios V. Vasilakos
Anonymous Aggregate Fine-Grained Cloud Data Verification System for Smart Health. IEEE Trans. Cloud Comput. 11 (3) (2023)
Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario
QC-LDPC Codes With Large Column Weight and Free of Small Size ETSs. IEEE Commun. Lett. 26 (3) (2022)
Farzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi
Trade-Based LDPC Codes. ISIT (2022)
Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario
Protograph-based LDPC codes with chordless short cycles and large minimum distance. CWIT (2022)
Alireza Eshraghi Dehaghani, Mohammad-Reza Sadeghi, Farzane Amirzade
Improving Asymptotic Properties of Loop Construction of SC-LDPC Chains Over the BEC. IEEE Commun. Lett. 26 (3) (2022)
Farzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi
Trade-Based LDPC Codes. CoRR (2021)
Hassan Khodaiemehr, Daniel Panario, Mohammad-Reza Sadeghi
Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels. IEEE Trans. Inf. Theory 67 (1) (2021)
Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario
Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length. ISIT (2021)
Mohammad Ali, Mohammad-Reza Sadeghi
Provable secure lightweight attribute-based keyword search for cloud-based Internet of Things networks. Trans. Emerg. Telecommun. Technol. 32 (5) (2021)
Mohammad Ali, Javad Mohajeri, Mohammad-Reza Sadeghi, Ximeng Liu
A fully distributed hierarchical attribute-based encryption scheme. Theor. Comput. Sci. 815 (2020)
Mohammad-Reza Sadeghi, Farzane Amirzade
Edge-Coloring Technique to Analyze Elementary Trapping Sets of Spatially-Coupled LDPC Convolutional Codes. IEEE Commun. Lett. 24 (4) (2020)
Mohammad Ali, Mohammad-Reza Sadeghi, Ximeng Liu
Lightweight Revocable Hierarchical Attribute-Based Encryption for Internet of Things. IEEE Access 8 (2020)
Mohammad Ali, Mohammad-Reza Sadeghi, Ximeng Liu
Lightweight Fine-Grained Access Control for Wireless Body Area Networks. Sensors 20 (4) (2020)
Parvaneh Amirzade Dana, Zahra Esmaeilbeig, Mohammad-Reza Sadeghi
Reliability enhancement and packet loss recovery of any steganographic method in voice over IP. Wirel. Networks 26 (8) (2020)
Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario
QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field. Adv. Math. Commun. 14 (3) (2020)
Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario
Construction of protograph-based LDPC codes with chordless short cycles. CoRR (2020)
Mohammad Ali, Javad Mohajeri, Mohammad-Reza Sadeghi, Ximeng Liu
Attribute-based fine-grained access control for outscored private set intersection computation. Inf. Sci. 536 (2020)
Hassan Khodaiemehr, Daniel Panario, Mohammad-Reza Sadeghi
Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels. CoRR (2020)
Khadijeh Bagheri, Taraneh Eghlidos, Mohammad-Reza Sadeghi, Daniel Panario, Hassan Khodaiemehr
A Joint Encryption, Channel Coding and Modulation Scheme Using QC-LDPC Lattice-Codes. IEEE Trans. Commun. 68 (8) (2020)
Mohammad-Reza Sadeghi
Optimal Search for Girth-8 Quasi Cyclic and Spatially Coupled Multiple-Edge LDPC Codes. IEEE Commun. Lett. 23 (9) (2019)
Hadi Rahbani, Nader Jafari Rad, Mohammad-Reza Sadeghi
A note on the complexity of locating-total domination in graphs. Theor. Comput. Sci. 799 (2019)
Khadijeh Bagheri, Taraneh Eghlidos, Mohammad-Reza Sadeghi, Daniel Panario
A Lattice Based Joint Encryption, Encoding and Modulation Scheme. CoRR (2019)
Farzane Amirzade, Mohammad-Reza Sadeghi
Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size. CoRR (2018)
Mohammad-Reza Sadeghi, Farzane Amirzade, Daniel Panario, Amin Sakzad
A Neural Network Lattice Decoding Algorithm. ITW (2018)
Mohammad-Reza Sadeghi, Farzane Amirzade, Daniel Panario, Amin Sakzad
A Neural Network Lattice Decoding Algorithm. CoRR (2018)
Khadijeh Bagheri, Mohammad-Reza Sadeghi, Daniel Panario
A non-commutative cryptosystem based on quaternion algebras. Des. Codes Cryptogr. 86 (10) (2018)
Hassan Khodaiemehr, Daniel Panario, Mohammad-Reza Sadeghi
Modular Construction a Lattices from Cyclotomic Fields and their Applications in Information Security. ISCISC (2018)
Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi, Brett Stevens
On the algorithmic complexity of decomposing graphs into regular/irregular structures. CoRR (2018)
Mohammad Ali, Javad Mohajeri, Mohammad-Reza Sadeghi
On the security of the hierarchical attribute based encryption scheme proposed by Wang et al. CoRR (2018)
Mohammad-Reza Sadeghi, Farzane Amirzade
Edge Coloring Technique to Remove Small Elementary Trapping Sets from Tanner Graph of QC-LDPC Codes with Column Weight 4. CoRR (2018)
Mohammad-Reza Sadeghi, Farzane Amirzade
Analytical Lower Bound on the Lifting Degree of Multiple-Edge QC-LDPC Codes With Girth 6. IEEE Commun. Lett. 22 (8) (2018)
Farzane Amirzade, Mohammad-Reza Sadeghi
Analytical Lower Bounds on the Size of Elementary Trapping Sets of Variable-Regular LDPC Codes With Any Girth and Irregular Ones With Girth 8. IEEE Trans. Commun. 66 (6) (2018)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
Sigma Partitioning: Complexity and Random Graphs. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. CoRR (2018)
Farzane Amirzade, Mohammad-Reza Sadeghi
Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices. IEEE Access 6 (2018)
Alireza Tasdighi, Mohammad-Reza Sadeghi
On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families. CoRR (2017)
Khadijeh Bagheri, Mohammad-Reza Sadeghi, Daniel Panario
A Non-commutative Cryptosystem Based on Quaternion Algebras. CoRR (2017)
Khadijeh Bagheri, Mohammad-Reza Sadeghi, Taraneh Eghlidos
An Efficient Public Key Encryption Scheme Based on QC-MDPC Lattices. IEEE Access 5 (2017)
Farzane Amirzade, Mohammad-Reza Sadeghi
Analytical lower bounds for the size of elementary trapping sets of variable-regular LDPC codes with any girth and irregular ones with girth 8. CoRR (2017)
Farzane Amirzade, Mohammad-Reza Sadeghi
Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices. CoRR (2017)
Alireza Tasdighi, Amir H. Banihashemi, Mohammad-Reza Sadeghi
Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes. IEEE Trans. Commun. 65 (1) (2017)
Ali Dehghan, Mohammad-Reza Sadeghi
Colorful edge decomposition of graphs: Some polynomial cases. Discret. Appl. Math. 231 (2017)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
Algorithmic complexity of proper labeling problems. CoRR (2017)
Hassan Khodaiemehr, Dariush Kiani, Mohammad-Reza Sadeghi
LDPC Lattice Codes for Full-Duplex Relay Channels. IEEE Trans. Commun. 65 (2) (2017)
Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Amin Sakzad
Practical Encoder and Decoder for Power Constrained QC LDPC-Lattice Codes. IEEE Trans. Commun. 65 (2) (2017)
Alireza Tasdighi, Amir H. Banihashemi, Mohammad-Reza Sadeghi
Efficient Search of Girth-Optimal QC-LDPC Codes. IEEE Trans. Inf. Theory 62 (4) (2016)
Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Daniel Panario
Construction of full-diversity 1-level LDPC lattices for block-fading channels. ISIT (2016)
Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Amin Sakzad
Practical Encoder and Decoder for Power Constrained QC-LDPC lattices. CoRR (2016)
Khadijeh Bagheri, Mohammad-Reza Sadeghi, Taraneh Eghlidos, Daniel Panario
A secret key encryption scheme based on 1-level QC-LDPC lattices. ISCISC (2016)
Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Daniel Panario
Construction of Full-Diversity LDPC Lattices for Block-Fading Channels. CoRR (2016)
Ali Dehghan, Mohammad-Reza Sadeghi
On the algorithmic complexity of zero-sum edge-coloring. Inf. Process. Lett. 116 (11) (2016)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
On the Complexity of Deciding Whether the Regular Number is at Most Two. Graphs Comb. 31 (5) (2015)
Seyyedali Hosseinalipour, Amin Sakzad, Mohammad-Reza Sadeghi
Minimum free distance of CCSDS turbo encoders under (Truncated) Möbius interleavers. IWCIT (2015)
Kadijeh Bagheri, Mohammad-Reza Sadeghi
A new non-associative cryptosystem based on NTOW public key cryptosystem and octonions algebra. ACM Commun. Comput. Algebra 49 (1) (2015)
Malihe Aliasgari, Daniel Panario, Mohammad-Reza Sadeghi
Binomial ideal associated to a lattice and its label code. ACM Commun. Comput. Algebra 49 (1) (2015)
Hassan Khodaiemehr, Dariush Kiani, Mohammad-Reza Sadeghi
One-level LDPC lattice codes for the relay channels. IWCIT (2015)
Ali Dehghan, Mohammad-Reza Sadeghi
The complexity of the zero-sum 3-flows. Inf. Process. Lett. 115 (2) (2015)
Malihe Aliasgari, Mohammad-Reza Sadeghi, Daniel Panario
A Johnson-type bound for group codes and lattices. ACM Commun. Comput. Algebra 49 (1) (2015)
Malihe Aliasgari, Mohammad-Reza Sadeghi
. IEEE Commun. Lett. 18 (5) (2014)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
On the complexity of deciding whether the regular number is at most two. CoRR (2014)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
The Complexity of the Sigma Chromatic Number of Cubic Graphs. CoRR (2014)
Mohammad-Reza Sadeghi, Amin Sakzad
On the performance of 1-level LDPC lattices. IWCIT (2013)
Mohammad-Reza Sadeghi, Amin Sakzad
On the performance of 1-level LDPC lattices CoRR (2013)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
Algorithmic complexity of proper labeling problems. Theor. Comput. Sci. 495 (2013)
Malihe Aliasgari, Mohammad-Reza Sadeghi, Daniel Panario
Grobner Bases for Lattices and an Algebraic Decoding Algorithm. IEEE Trans. Commun. 61 (4) (2013)
Lida Safarnejad, Mohammad-Reza Sadeghi
FFT Based Sum-Product Algorithm for Decoding LDPC Lattices. IEEE Commun. Lett. 16 (9) (2012)
Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario
Cycle structure of permutation functions over finite fields and their applications. Adv. Math. Commun. 6 (3) (2012)
Hassan Mehri, Mohammad-Reza Sadeghi
Construction of LDGM lattices CoRR (2012)
Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario
Turbo Lattices: Construction and Performance Analysis CoRR (2011)
Malihe Aliasgari, Mohammad-Reza Sadeghi, Daniel Panario
Gröbner bases for lattices and an algebraic decoding algorithm. Allerton (2011)
Asie Abolpour, Mohammad-Reza Sadeghi, Daniel Panario
Extended bit-flipping algorithm for solving sparse linear systems of equations modulo p. ITW (2011)
Amin Sakzad, Mohammad-Reza Sadeghi
On cycle-free lattices with high rate label codes. Adv. Math. Commun. 4 (4) (2010)
Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario
Construction of turbo lattices. Allerton (2010)
Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario, Nasim Eshghi
Self-Inverse Interleavers for Turbo Codes CoRR (2010)
Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario
Codes with girth 8 Tanner graph representation. Des. Codes Cryptogr. 57 (1) (2010)
Amin Sakzad, Daniel Panario, Mohammad-Reza Sadeghi, Nasim Eshghi
Self-inverse interleavers based on permutation functions for turbo codes. Allerton (2010)
Mohammad-Reza Sadeghi, Amir H. Banihashemi, Daniel Panario
Low-Density Parity-Check Lattices: Construction and Decoding Analysis. IEEE Trans. Inf. Theory 52 (10) (2006)
Mohammad-Reza Sadeghi, Daniel Panario
Low density parity check lattices based on construction D' and cycle-free Tanner graphs. Algebraic Coding Theory and Information Theory (2003)