1 citations · 1 across the 5 of their papers we have counts for
5 papers
An Efficient Algorithm for Counting Cycles in QC and APM LDPC Codes
Mohammad Gholami, Zahra Gholami
In this paper, a new method is given for counting cycles in the Tanner graph of a (Type-I) quasi-cyclic (QC) low-density parity-check (LDPC) code which the complexity mainly is dep…
Quasi Cyclic LDPC Codes Based on Finite Set Systems
Mohammad Gholami, Mehdi Samadieh
A finite set system (FSS) is a pair (V; B) where V is a finite set whose members are called points, equipped with a finite collection of its subsets B whose members are called bloc…
Column Weight Two and Three LDPC Codes with High Rates and Large Girths
Mohammad Gholami, Ghaffar Raeisi
In this paper, the concept of the {\it broken diagonal pair} in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be con…
New LDPC Codes Using Permutation Matrices with Higher Girth than QC-LDPC Codes Constructed by Fossorier
Mehdi samadieh, Mohammad Gholami
In the literatures, it is well-known that Fossorier code has the girth among LDPC codes. In this paper, we introduce a new class of low-density parity-check (LDPC) codes, with high…
Double Cylinder Cycle codes of Arbitrary Girth
Mehdi Samadieh, Mohammad Gholamiy
A particular class of low-density parity-check codes referred to as cylinder-type BC-LDPC codes is proposed by Gholami and Eesmaeili. In this paper We represent a double cylinder-t…