
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 ...
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...
read it

Construction of QCLDPC Codes with Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets
We propose a systematic design of protographbased quasicyclic (QC) low...
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...
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...
read it

Cluster Size Optimization in Cooperative Spectrum Sensing
In this paper, we study and optimize the cooperation cluster size in coo...
read it

Characterization and Efficient Search of NonElementary Trapping Sets of LDPC Codes with Applications to Stopping Sets
In this paper, we propose a characterization for nonelementary trapping...
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...
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...
read it
Amir H. Banihashemi
is this you? claim profile