1. 4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION

Z. Gholami; M. Gholami

Volume 8, Issue 2 , Winter and Spring 2021, , Pages 283-289

Abstract
  Recently, a class of low-density parity-check codes based on affine permutation matrices, called APM-LDPC codes, have been considered which have some advantages than quasi-cyclic (QC) LDPC codes in terms of minimum-distance, cycle distribution, and error-rate performance. Moreover, some explicit constructions ...  Read More

2. A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8

F. Amirzade; M. Alishahi; M.R. Rafsanjani-Sadeghi

Volume 7, Issue 2 , Winter and Spring 2020, , Pages 271-280

Abstract
  In this paper, we define a structure to obtain exponent matrices of girth-8 QC-LDPC codes with column weight 3. Using the difference matrices introduced by Amirzade et al., we investigate necessary and sufficient conditions which result in a Tanner graph with girth 8. Our proposed method contributes ...  Read More

3. THE ZERO-DIVISOR GRAPH OF A MODULE

A. Naghipour

Volume 4, Issue 2 , Winter and Spring 2017, , Pages 155-171

Abstract
  Let R be a commutative ring with identity and M an R-module. In this paper, we associate a graph to M, sayΓ(RM), such that when M=R, Γ(RM) coincide with the zero-divisor graph of R. Many well-known results by D.F. Anderson and P.S. Livingston have been generalized for ...  Read More