default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad-Reza Sadeghi 0001
Mohammad-Reza (Rafsanjani) Sadeghi
Person information
- affiliation: Amirkabir University of Technology, Department of Mathematics and Computer Science, Tehran, Iran
Other persons with the same name
- Mohammad-Reza Sadeghi 0002 — Allameh Tabataba'i University of Tehran, Department of Industrial Management, Iran
Other persons with a similar name
- Mohammad Reza Sadeghi Moghadam — University of Tehran, Department of Industrial Management, Iran
- Mohammad Reza Sadeghi Moghaddam
SPARQL queries 
🛈 Please note that only 69% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j44]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): 3-15 (2024)- [j43]Farzane Amirzade
, Mohammad-Reza Sadeghi, Daniel Panario:
Construction of Protograph-Based LDPC Codes With Chordless Short Cycles. IEEE Trans. Inf. Theory 70(1): 51-74 (2024) - [c16]Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Disjoint Difference Sets and QC-LDPC Codes With Girth 10. IWCIT 2024: 1-5 - 2023
- [j42]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): 2839-2855 (2023) - [i26]Hassan Noghrei, Mohammad-Reza Sadeghi, Wai Ho Mow:
Efficient Active Deep Decoding of Linear Codes using Importance Sampling. CoRR abs/2310.13275 (2023) - 2022
- [j41]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): 495-499 (2022) - [j40]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): 500-504 (2022) - [c15]Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Protograph-based LDPC codes with chordless short cycles and large minimum distance. CWIT 2022: 16-20 - [c14]Farzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi:
Trade-Based LDPC Codes. ISIT 2022: 542-547 - 2021
- [j39]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) - [j38]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): 138-163 (2021) - [c13]Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length. ISIT 2021: 368-373 - [i25]Farzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi:
Trade-Based LDPC Codes. CoRR abs/2107.07466 (2021) - 2020
- [j37]Mohammad Ali, Mohammad-Reza Sadeghi, Ximeng Liu:
Lightweight Revocable Hierarchical Attribute-Based Encryption for Internet of Things. IEEE Access 8: 23951-23964 (2020) - [j36]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): 397-411 (2020) - [j35]Mohammad-Reza Sadeghi, Farzane Amirzade:
Edge-Coloring Technique to Analyze Elementary Trapping Sets of Spatially-Coupled LDPC Convolutional Codes. IEEE Commun. Lett. 24(4): 711-715 (2020) - [j34]Mohammad Ali, Javad Mohajeri, Mohammad-Reza Sadeghi, Ximeng Liu:
Attribute-based fine-grained access control for outscored private set intersection computation. Inf. Sci. 536: 222-243 (2020) - [j33]Mohammad Ali, Mohammad-Reza Sadeghi, Ximeng Liu:
Lightweight Fine-Grained Access Control for Wireless Body Area Networks. Sensors 20(4): 1088 (2020) - [j32]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): 4673-4693 (2020) - [j31]Mohammad Ali, Javad Mohajeri, Mohammad-Reza Sadeghi, Ximeng Liu:
A fully distributed hierarchical attribute-based encryption scheme. Theor. Comput. Sci. 815: 25-46 (2020) - [j30]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): 5817-5823 (2020) - [i24]Hassan Khodaiemehr, Daniel Panario, Mohammad-Reza Sadeghi:
Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels. CoRR abs/2007.05370 (2020) - [i23]Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Construction of protograph-based LDPC codes with chordless short cycles. CoRR abs/2008.01322 (2020)
2010 – 2019
- 2019
- [j29]Mohammad-Reza Sadeghi:
Optimal Search for Girth-8 Quasi Cyclic and Spatially Coupled Multiple-Edge LDPC Codes. IEEE Commun. Lett. 23(9): 1466-1469 (2019) - [j28]Hadi Rahbani, Nader Jafari Rad, Mohammad-Reza Sadeghi:
A note on the complexity of locating-total domination in graphs. Theor. Comput. Sci. 799: 32-39 (2019) - [i22]Khadijeh Bagheri, Taraneh Eghlidos, Mohammad-Reza Sadeghi, Daniel Panario:
A Lattice Based Joint Encryption, Encoding and Modulation Scheme. CoRR abs/1906.06280 (2019) - 2018
- [j27]Farzane Amirzade, Mohammad-Reza Sadeghi:
Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices. IEEE Access 6: 23688-23700 (2018) - [j26]Ali Dehghan, Mohammad-Reza (Rafsanjani) Sadeghi, Arash Ahadi:
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. Algorithmica 80(12): 3704-3727 (2018) - [j25]Khadijeh Bagheri, Mohammad-Reza Sadeghi, Daniel Panario:
A non-commutative cryptosystem based on quaternion algebras. Des. Codes Cryptogr. 86(10): 2345-2377 (2018) - [j24]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Sigma Partitioning: Complexity and Random Graphs. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j23]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): 1528-1531 (2018) - [j22]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): 2313-2321 (2018) - [j21]Seyyedali Hosseinalipour, Amin Sakzad, Mohammad-Reza (Rafsanjani) Sadeghi:
Performance of Möbius Interleavers for Turbo Codes. Wirel. Pers. Commun. 98(1): 271-291 (2018) - [c12]Hassan Khodaiemehr, Daniel Panario, Mohammad-Reza Sadeghi:
Modular Construction a Lattices from Cyclotomic Fields and their Applications in Information Security. ISCISC 2018: 1-8 - [c11]Mohammad-Reza Sadeghi, Farzane Amirzade, Daniel Panario, Amin Sakzad:
A Neural Network Lattice Decoding Algorithm. ITW 2018: 1-5 - [i21]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. CoRR abs/1801.04472 (2018) - [i20]Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi, Brett Stevens:
On the algorithmic complexity of decomposing graphs into regular/irregular structures. CoRR abs/1801.08876 (2018) - [i19]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 abs/1803.08141 (2018) - [i18]Mohammad-Reza Sadeghi, Farzane Amirzade, Daniel Panario, Amin Sakzad:
A Neural Network Lattice Decoding Algorithm. CoRR abs/1807.02913 (2018) - [i17]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 abs/1808.05258 (2018) - [i16]Mohammad Ali, Javad Mohajeri, Mohammad-Reza Sadeghi:
On the security of the hierarchical attribute based encryption scheme proposed by Wang et al. CoRR abs/1810.05864 (2018) - [i15]Mohammad Ali, Javad Mohajeri, Mohammad-Reza (Rafsanjani) Sadeghi:
A fully distributed revocable ciphertext-policy hierarchical attribute-based encryption without pairing. IACR Cryptol. ePrint Arch. 2018: 1102 (2018) - 2017
- [j20]Khadijeh Bagheri, Mohammad-Reza Sadeghi, Taraneh Eghlidos:
An Efficient Public Key Encryption Scheme Based on QC-MDPC Lattices. IEEE Access 5: 25527-25541 (2017) - [j19]Ali Dehghan, Mohammad-Reza Sadeghi:
Colorful edge decomposition of graphs: Some polynomial cases. Discret. Appl. Math. 231: 155-165 (2017) - [j18]Alireza Tasdighi, Amir H. Banihashemi, Mohammad-Reza Sadeghi:
Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes. IEEE Trans. Commun. 65(1): 14-22 (2017) - [j17]Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Amin Sakzad:
Practical Encoder and Decoder for Power Constrained QC LDPC-Lattice Codes. IEEE Trans. Commun. 65(2): 486-500 (2017) - [j16]Hassan Khodaiemehr, Dariush Kiani, Mohammad-Reza Sadeghi:
LDPC Lattice Codes for Full-Duplex Relay Channels. IEEE Trans. Commun. 65(2): 536-548 (2017) - [i14]Alireza Tasdighi, Mohammad-Reza Sadeghi:
On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families. CoRR abs/1701.06218 (2017) - [i13]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Algorithmic complexity of proper labeling problems. CoRR abs/1701.06669 (2017) - [i12]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 abs/1706.01703 (2017) - [i11]Farzane Amirzade, Mohammad-Reza Sadeghi:
Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices. CoRR abs/1709.00825 (2017) - [i10]Khadijeh Bagheri, Mohammad-Reza Sadeghi, Daniel Panario:
A Non-commutative Cryptosystem Based on Quaternion Algebras. CoRR abs/1709.02079 (2017) - 2016
- [j15]Ali Dehghan, Mohammad-Reza Sadeghi:
On the algorithmic complexity of zero-sum edge-coloring. Inf. Process. Lett. 116(11): 660-667 (2016) - [j14]Alireza Tasdighi, Amir H. Banihashemi, Mohammad-Reza Sadeghi:
Efficient Search of Girth-Optimal QC-LDPC Codes. IEEE Trans. Inf. Theory 62(4): 1552-1564 (2016) - [c10]Khadijeh Bagheri, Mohammad-Reza Sadeghi, Taraneh Eghlidos, Daniel Panario:
A secret key encryption scheme based on 1-level QC-LDPC lattices. ISCISC 2016: 20-25 - [c9]Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Daniel Panario:
Construction of full-diversity 1-level LDPC lattices for block-fading channels. ISIT 2016: 2714-2718 - [i9]Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Amin Sakzad:
Practical Encoder and Decoder for Power Constrained QC-LDPC lattices. CoRR abs/1603.07010 (2016) - [i8]Hassan Khodaiemehr, Dariush Kiani, Mohammad-Reza (Rafsanjani) Sadeghi:
LDPC Lattice Codes for Full-Duplex Relay Channels. CoRR abs/1608.03874 (2016) - [i7]Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Daniel Panario:
Construction of Full-Diversity LDPC Lattices for Block-Fading Channels. CoRR abs/1612.04039 (2016) - 2015
- [j13]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): 13 (2015) - [j12]Malihe Aliasgari, Mohammad-Reza Sadeghi, Daniel Panario:
A Johnson-type bound for group codes and lattices. ACM Commun. Comput. Algebra 49(1): 16 (2015) - [j11]Malihe Aliasgari, Daniel Panario, Mohammad-Reza Sadeghi:
Binomial ideal associated to a lattice and its label code. ACM Commun. Comput. Algebra 49(1): 16-17 (2015) - [j10]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
On the Complexity of Deciding Whether the Regular Number is at Most Two. Graphs Comb. 31(5): 1359-1365 (2015) - [j9]Ali Dehghan, Mohammad-Reza Sadeghi:
The complexity of the zero-sum 3-flows. Inf. Process. Lett. 115(2): 316-320 (2015) - [c8]Seyyedali Hosseinalipour, Amin Sakzad, Mohammad-Reza Sadeghi:
Minimum free distance of CCSDS turbo encoders under (Truncated) Möbius interleavers. IWCIT 2015: 1-6 - [c7]Hassan Khodaiemehr, Dariush Kiani, Mohammad-Reza Sadeghi:
One-level LDPC lattice codes for the relay channels. IWCIT 2015: 1-6 - 2014
- [j8]Malihe Aliasgari, Mohammad-Reza Sadeghi:
An Algebraic Method for Decoding q-ary Codes via Submodules of Zn. IEEE Commun. Lett. 18(5): 857-860 (2014) - [i6]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
On the complexity of deciding whether the regular number is at most two. CoRR abs/1403.1182 (2014) - [i5]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
The Complexity of the Sigma Chromatic Number of Cubic Graphs. CoRR abs/1403.6288 (2014) - 2013
- [j7]Malihe Aliasgari, Mohammad-Reza Sadeghi, Daniel Panario:
Grobner Bases for Lattices and an Algebraic Decoding Algorithm. IEEE Trans. Commun. 61(4): 1222-1230 (2013) - [j6]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Algorithmic complexity of proper labeling problems. Theor. Comput. Sci. 495: 25-36 (2013) - [c6]Mohammad-Reza Sadeghi, Amin Sakzad:
On the performance of 1-level LDPC lattices. IWCIT 2013: 1-5 - [i4]Mohammad-Reza Sadeghi, Amin Sakzad:
On the performance of 1-level LDPC lattices. CoRR abs/1302.0459 (2013) - 2012
- [j5]Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario:
Cycle structure of permutation functions over finite fields and their applications. Adv. Math. Commun. 6(3): 347-361 (2012) - [j4]Lida Safarnejad, Mohammad-Reza Sadeghi:
FFT Based Sum-Product Algorithm for Decoding LDPC Lattices. IEEE Commun. Lett. 16(9): 1504-1507 (2012) - [i3]Hassan Mehri, Mohammad-Reza Sadeghi:
Construction of LDGM lattices. CoRR abs/1205.5863 (2012) - 2011
- [c5]Malihe Aliasgari, Mohammad-Reza Sadeghi, Daniel Panario:
Gröbner bases for lattices and an algebraic decoding algorithm. Allerton 2011: 1414-1415 - [c4]Asie Abolpour, Mohammad-Reza Sadeghi, Daniel Panario:
Extended bit-flipping algorithm for solving sparse linear systems of equations modulo p. ITW 2011: 688-692 - [i2]Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario:
Turbo Lattices: Construction and Performance Analysis. CoRR abs/1108.1873 (2011) - 2010
- [j3]Amin Sakzad, Mohammad-Reza Sadeghi:
On cycle-free lattices with high rate label codes. Adv. Math. Commun. 4(4): 441-452 (2010) - [j2]Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario:
Codes with girth 8 Tanner graph representation. Des. Codes Cryptogr. 57(1): 71-81 (2010) - [c3]Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario:
Construction of turbo lattices. Allerton 2010: 14-21 - [c2]Amin Sakzad, Daniel Panario, Mohammad-Reza Sadeghi, Nasim Eshghi:
Self-inverse interleavers based on permutation functions for turbo codes. Allerton 2010: 22-28 - [i1]Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario, Nasim Eshghi:
Self-Inverse Interleavers for Turbo Codes. CoRR abs/1011.1539 (2010)
2000 – 2009
- 2006
- [j1]Mohammad-Reza Sadeghi, Amir H. Banihashemi, Daniel Panario:
Low-Density Parity-Check Lattices: Construction and Decoding Analysis. IEEE Trans. Inf. Theory 52(10): 4481-4495 (2006) - 2003
- [c1]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: 85-90
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-08-05 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
