4 citations · 18 across the 8 of their papers we have counts for
9 papers
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…
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…
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…
Smallest defining sets of super-simple 2 - (v, 4,1) directed designs
Nasrin Soltankhah, Farzane Amirzade
A directed design (or simply a ) is super-simple if its underlying is super-simple, that is, any two blocks of the intersect in at…
Super-simple 2-(v; 5; 1) directed designs and their smallest defining sets
Nasrin Soltankhah, Farzane Amirzade
In this paper we investigate the spectrum of super-simple 2- directed designs (or simply super-simple 2-DDs) and also the size of their smallest defining sets. We…