Mohammad-Reza Sadeghi

IEEE Trans. Inf. Theory, January, 2024

Linear label code of a root lattice using Gröbner bases.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., January, 2024

2023

Anonymous Aggregate Fine-Grained Cloud Data Verification System for Smart Health.

[BibT_eX]

[DOI]

Athanasios V. Vasilakos

IEEE Trans. Cloud Comput., 2023

Efficient Active Deep Decoding of Linear Codes using Importance Sampling.

[BibT_eX]

[DOI]

Hassan Noghrei

Alireza Eshraghi Dehaghani

Wai Ho Mow

CoRR, 2023

2022

Improving Asymptotic Properties of Loop Construction of SC-LDPC Chains Over the BEC.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2022

QC-LDPC Codes With Large Column Weight and Free of Small Size ETSs.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2022

Trade-Based LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Protograph-based LDPC codes with chordless short cycles and large minimum distance.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Workshop on Information Theory, 2022

2021

Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Provable secure lightweight attribute-based keyword search for cloud-based Internet of Things networks.

[BibT_eX]

[DOI]

Trans. Emerg. Telecommun. Technol., 2021

Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Reliability enhancement and packet loss recovery of any steganographic method in voice over IP.

[BibT_eX]

[DOI]

Parvaneh Amirzade Dana

Zahra Esmaeilbeig

Wirel. Networks, 2020

A fully distributed hierarchical attribute-based encryption scheme.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A Joint Encryption, Channel Coding and Modulation Scheme Using QC-LDPC Lattice-Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2020

Lightweight Fine-Grained Access Control for Wireless Body Area Networks.

[BibT_eX]

[DOI]

Sensors, 2020

Attribute-based fine-grained access control for outscored private set intersection computation.

[BibT_eX]

[DOI]

Inf. Sci., 2020

Edge-Coloring Technique to Analyze Elementary Trapping Sets of Spatially-Coupled LDPC Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2020

QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2020

Lightweight Revocable Hierarchical Attribute-Based Encryption for Internet of Things.

[BibT_eX]

[DOI]

IEEE Access, 2020

2019

A note on the complexity of locating-total domination in graphs.

[BibT_eX]

[DOI]

Hadi Rahbani

Nader Jafari Rad

Theor. Comput. Sci., 2019

Optimal Search for Girth-8 Quasi Cyclic and Spatially Coupled Multiple-Edge LDPC Codes.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2019

A Lattice Based Joint Encryption, Encoding and Modulation Scheme.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Performance of Möbius Interleavers for Turbo Codes.

[BibT_eX]

[DOI]

Seyyedali Hosseinalipour

Mohammad-Reza (Rafsanjani) Sadeghi

Wirel. Pers. Commun., 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.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2018

Analytical Lower Bound on the Lifting Degree of Multiple-Edge QC-LDPC Codes With Girth 6.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2018

A fully distributed revocable ciphertext-policy hierarchical attribute-based encryption without pairing.

[BibT_eX]

[DOI]

Mohammad-Reza (Rafsanjani) Sadeghi

IACR Cryptol. ePrint Arch., 2018

Sigma Partitioning: Complexity and Random Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2018

A non-commutative cryptosystem based on quaternion algebras.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2018

On the security of the hierarchical attribute based encryption scheme proposed by Wang et al.

[BibT_eX]

[DOI]

CoRR, 2018

Edge Coloring Technique to Remove Small Elementary Trapping Sets from Tanner Graph of QC-LDPC Codes with Column Weight 4.

[BibT_eX]

[DOI]

CoRR, 2018

Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size.

[BibT_eX]

[DOI]

CoRR, 2018

On the algorithmic complexity of decomposing graphs into regular/irregular structures.

[BibT_eX]

[DOI]

Brett Stevens

CoRR, 2018

Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications.

[BibT_eX]

[DOI]

Mohammad-Reza (Rafsanjani) Sadeghi

Algorithmica, 2018

Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices.

[BibT_eX]

[DOI]

IEEE Access, 2018

A Neural Network Lattice Decoding Algorithm.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Modular Construction a Lattices from Cyclotomic Fields and their Applications in Information Security.

[BibT_eX]

[DOI]

Proceedings of the 15th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology, 2018

2017

Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes.

[BibT_eX]

[DOI]

Alireza Tasdighi

Amir H. Banihashemi

IEEE Trans. Commun., 2017

LDPC Lattice Codes for Full-Duplex Relay Channels.

[BibT_eX]

[DOI]

Dariush Kiani

IEEE Trans. Commun., 2017

Practical Encoder and Decoder for Power Constrained QC LDPC-Lattice Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2017

Colorful edge decomposition of graphs: Some polynomial cases.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices.

[BibT_eX]

[DOI]

CoRR, 2017

On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families.

[BibT_eX]

[DOI]

Alireza Tasdighi

CoRR, 2017

An Efficient Public Key Encryption Scheme Based on QC-MDPC Lattices.

[BibT_eX]

[DOI]

IEEE Access, 2017

2016

Efficient Search of Girth-Optimal QC-LDPC Codes.

[BibT_eX]

[DOI]

Alireza Tasdighi

Amir H. Banihashemi

IEEE Trans. Inf. Theory, 2016

On the algorithmic complexity of zero-sum edge-coloring.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Practical Encoder and Decoder for Power Constrained QC-LDPC lattices.

[BibT_eX]

[DOI]

CoRR, 2016

Construction of Full-Diversity LDPC Lattices for Block-Fading Channels.

[BibT_eX]

[DOI]

CoRR, 2016

Construction of full-diversity 1-level LDPC lattices for block-fading channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

A secret key encryption scheme based on 1-level QC-LDPC lattices.

[BibT_eX]

[DOI]

Proceedings of the 13th International Iranian Society of Cryptology Conference on Information Security and Cryptology, 2016

2015

The complexity of the zero-sum 3-flows.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

On the Complexity of Deciding Whether the Regular Number is at Most Two.

[BibT_eX]

[DOI]

Graphs Comb., 2015

A new non-associative cryptosystem based on NTOW public key cryptosystem and octonions algebra.

[BibT_eX]

[DOI]

Kadijeh Bagheri

ACM Commun. Comput. Algebra, 2015

Binomial ideal associated to a lattice and its label code.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

A Johnson-type bound for group codes and lattices.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

One-level LDPC lattice codes for the relay channels.

[BibT_eX]

[DOI]

Dariush Kiani

Proceedings of the Iran Workshop on Communication and Information Theory, 2015

Minimum free distance of CCSDS turbo encoders under (Truncated) Möbius interleavers.

[BibT_eX]

[DOI]

Seyyedali Hosseinalipour

Proceedings of the Iran Workshop on Communication and Information Theory, 2015

2014

An Algebraic Method for Decoding q-ary Codes via Submodules of Z<sup>n</sup>.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2014

The Complexity of the Sigma Chromatic Number of Cubic Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Algorithmic complexity of proper labeling problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Grobner Bases for Lattices and an Algebraic Decoding Algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2013

On the performance of 1-level LDPC lattices.

[BibT_eX]

[DOI]

Proceedings of the Iran Workshop on Communication and Information Theory, 2013

2012

FFT Based Sum-Product Algorithm for Decoding LDPC Lattices.

[BibT_eX]

[DOI]

Lida Safarnejad

IEEE Commun. Lett., 2012

Construction of LDGM lattices

[BibT_eX]

[DOI]

Hassan Mehri

CoRR, 2012

Cycle structure of permutation functions over finite fields and their applications.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2012

2011

Turbo Lattices: Construction and Performance Analysis

[BibT_eX]

[DOI]

CoRR, 2011

Extended bit-flipping algorithm for solving sparse linear systems of equations modulo p.

[BibT_eX]

[DOI]

Asie Abolpour

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010

Codes with girth 8 Tanner graph representation.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2010

Self-Inverse Interleavers for Turbo Codes

[BibT_eX]

[DOI]

Nasim Eshghi

CoRR, 2010

On cycle-free lattices with high rate label codes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2010

Construction of turbo lattices.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

Self-inverse interleavers based on permutation functions for turbo codes.

[BibT_eX]

[DOI]

Nasim Eshghi

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2006

Low-Density Parity-Check Lattices: Construction and Decoding Analysis.

[BibT_eX]

[DOI]

Amir H. Banihashemi

IEEE Trans. Inf. Theory, 2006

2003

Low density parity check lattices based on construction D' and cycle-free Tanner graphs.

[BibT_eX]