42 citations · 114 across the 25 of their papers we have counts for
29 papers
Bit-Level Triangular Content-Aware Permutation for Fragile Image Watermarking: Zero False Positive Rate, Single-Bit Sensitivity, and Arbitrary Dimension Support
Zahra Ghoraeian, Mohammad-Reza Sadeghi, Samaneh Mashhadi
With the growth of digital document exchange, protecting image integrity against attacks such as Vector Quantization (VQ) and collage has become critical. Existing methods are vuln…
A Content-Aware Pure Permutation with Intrinsic Avalanche Effect: Breaking the Diffusion-Permutation Dichotomy
Zahra Ghoraeian, Mohammad-Reza Sadeghi, Samaneh Mashhadi
Pixel permutation is a fundamental tool in image processing, image encryption, and data hiding (including watermarking and steganography) that rearranges pixels without changing th…
Efficient Active Deep Decoding of Linear Codes using Importance Sampling
Hassan Noghrei, Mohammad-Reza Sadeghi, Wai Ho Mow
The quality and quantity of data used for training greatly influence the performance and effectiveness of deep learning models. In the context of error correction, it is essential…
Trade-Based LDPC Codes
Farzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi
LDPC codes based on multiple-edge protographs potentially have larger minimum distances compared to their counterparts, single-edge protographs. However, considering different feat…
Construction of protograph-based LDPC codes with chordless short cycles
Farzane Amirzade, Mohammad-Reza~Sadeghi, Daniel Panario
Controlling small size trapping sets and short cycles can result in LDPC codes with large minimum distance . We prove that short cycles with a chord are the root of sever…
Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels
Hassan Khodaiemehr, Daniel Panario, Mohammad-Reza Sadeghi
Block-fading channel (BF) is a useful model for various wireless communication channels in both indoor and outdoor environments. The design of lattices for BF channels offers a cha…
A Lattice Based Joint Encryption, Encoding and Modulation Scheme
Khadijeh Bagheri, Taraneh Eghlidos, Mohammad-Reza Sadeghi +1
A new nonlinear Rao-Nam like symmetric key encryption scheme is presented in this paper. QC-LDPC lattices that are practically implementable in high dimensions due to their low com…
On the security of the hierarchical attribute based encryption scheme proposed by Wang et al
Mohammad Ali, Javad Mohajeri, Mohammad-Reza Sadeghi
Ciphertext-policy hierarchical attribute-based encryption (CP-HABE) is a promising cryptographic primitive for enforcing the fine-grained access control with scalable key delegatio…
Edge Coloring Technique to Remove Small Elementary Trapping Sets from Tanner Graph of QC-LDPC Codes with Column Weight 4
Mohammad-Reza Sadeghi, Farzane Amirzade
One of the phenomena that causes high decoding failure rates is trapping sets. Characterization of elementary trapping sets (ETSs), their graphical properties and the lower…
A Neural Network Lattice Decoding Algorithm
Mohammad-Reza Sadeghi, Farzane Amirzade, Daniel Panario +1
Neural network decoding algorithms are recently introduced by Nachmani et al. to decode high-density parity-check (HDPC) codes. In contrast with iterative decoding algorithms such…
Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size
Farzane Amirzade, Mohammad-Reza Sadeghi
One of the phenomena that influences significantly the performance of low-density parity-check codes is known as trapping sets. An elementary trapping set, or simply an ETS…
On the algorithmic complexity of decomposing graphs into regular/irregular structures
Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi +1
A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is…
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
A Not-All-Equal (NAE) decomposition of a graph is a decomposition of the vertices of into two parts such that each vertex in has at least one neighbor in each part. Als…
A Non-commutative Cryptosystem Based on Quaternion Algebras
Khadijeh Bagheri, Mohammad-Reza Sadeghi, Daniel Panario
We propose BQTRU, a non-commutative NTRU-like cryptosystem over quaternion algebras. This cryptosystem uses bivariate polynomials as the underling ring. The multiplication operatio…
Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices
Farzane Amirzade, Mohammad-Reza Sadeghi
In this paper, we define two matrices named as "difference matrices", denoted by and which significantly contribute to achieve regular single-edge QC-LDPC codes with the s…
Analytical lower bounds for the size of elementary trapping sets of variable-regular LDPC codes with any girth and irregular ones with girth 8
Farzane Amirzade, Mohammad-Reza Sadeghi
In this paper we give lower bounds on the size of elementary trapping sets (ETSs) belonging to variable-regular LDPC codes with any girth, , and irregular ones with girt…
Combining and Steganography of 3D Face Textures
Mohsen Moradi, Mohammad-Reza Sadeghi
One of the serious issues in communication between people is hiding information from others, and the best way for this, is deceiving them. Since nowadays face images are mostly use…
Algorithmic complexity of proper labeling problems
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex co…
On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families
A. Tasdighi, M. R. Sadeghi
A simple and general definition of quasi cyclic low density parity check (QC LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an spec…
Construction of Full-Diversity LDPC Lattices for Block-Fading Channels
Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Daniel Panario
LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high dimensions over an AWGN channel. Considering Construction D' of lattices with one…
LDPC Lattice Codes for Full-Duplex Relay Channels
Hassan Khodaiemehr, Dariush Kiani, Mohammad-Reza Sadeghi
Low density parity check (LDPC) lattices are obtained from Construction D' and a family of nested binary LDPC codes. We consider an special case of these lattices with one binary L…
Practical Encoder and Decoder for Power Constrained QC-LDPC lattices
Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Amin Sakzad
LDPC lattices were the first family of lattices that equipped with iterative decoding algorithms under which they perform very well in high dimensions. In this paper, we introduce…
On the complexity of deciding whether the regular number is at most two
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
The regular number of a graph G denoted by reg(G) is the minimum number of subsets into which the edge set of G can be partitioned so that the subgraph induced by each subset is re…
Sigma Partitioning: Complexity and Random Graphs
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
A of a graph is a partition of the vertices into sets such that for every two adjacent vertices and there is an index $…