26 citations · 66 across the 31 of their papers we have counts for
Showing 2019 · cs.ITShow all
2 papers · 2 filters
cs.IT2019
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix
Ali Dehghan, Amir H. Banihashemi
Counting short cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) codes. There are…
cs.IT2019
Construction of QC-LDPC Codes with Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets
Bashirreza Karimi, Amir. H Banihashemi
We propose a systematic design of protograph-based quasi-cyclic (QC) low-density parity-check (LDPC) codes with low error floor. We first characterize the trapping sets of such cod…