Amir H. Banihashemi

is this you? claim profile

Featured Co-authors

Ali Dehghan
10 publications
Ebrahim Karami
8 publications
Ali Farsiabi
1 publication
Yoones Hashemi
1 publication
Bashirreza Karimi
1 publication

Error Floor Analysis of LDPC Row Layered Decoders

In this paper, we analyze the error floor of quasi-cyclic (QC) low-densi...
04/14/2021 ∙ by Ali Farsiabi, et al. ∙ 0 ∙ share

read it
Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles

Finding the multiplicity of cycles in bipartite graphs is a fundamental ...
05/31/2019 ∙ by Ali Dehghan, et al. ∙ 0 ∙ share

read it
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix

Counting short cycles in bipartite graphs is a fundamental problem of in...
03/20/2019 ∙ by Ali Dehghan, et al. ∙ 0 ∙ share

read it
Construction of QC-LDPC Codes with Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets

We propose a systematic design of protograph-based quasi-cyclic (QC) low...
02/19/2019 ∙ by Bashirreza Karimi, et al. ∙ 0 ∙ share

read it
On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph

Counting short cycles in bipartite graphs is a fundamental problem of in...
06/04/2018 ∙ by Ali Dehghan, et al. ∙ 0 ∙ share

read it
On Computing the Multiplicity of Short Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph

Counting short cycles in bipartite graphs is a fundamental problem of in...
06/04/2018 ∙ by Ali Dehghan, et al. ∙ 0 ∙ share

read it
Cluster Size Optimization in Cooperative Spectrum Sensing

In this paper, we study and optimize the cooperation cluster size in coo...
03/10/2018 ∙ by Ebrahim Karami, et al. ∙ 0 ∙ share

read it
Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets

In this paper, we propose a characterization for non-elementary trapping...
01/06/2018 ∙ by Yoones Hashemi, et al. ∙ 0 ∙ share

read it
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes

Leafless elementary trapping sets (LETSs) are known to be the problemati...
11/28/2017 ∙ by Ali Dehghan, et al. ∙ 0 ∙ share

read it
From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes

Cages, defined as regular graphs with minimum number of nodes for a give...
11/28/2017 ∙ by Ali Dehghan, et al. ∙ 0 ∙ share

read it