26 citations · 66 across the 31 of their papers we have counts for
3 papers · 1 filter
A Message-Passing Algorithm for Counting Short Cycles in a Graph
Mehdi Karimi, Amir H. Banihashemi
A message-passing algorithm for counting short cycles in a graph is presented. For bipartite graphs, which are of particular interest in coding, the algorithm is capable of countin…
Lowering the Error Floor of LDPC Codes Using Cyclic Liftings
Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari
Cyclic liftings are proposed to lower the error floor of low-density parity-check (LDPC) codes. The liftings are designed to eliminate dominant trapping sets of the base code by re…
An Efficient Approach Toward the Asymptotic Analysis of Node-Based Recovery Algorithms in Compressed Sensing
Yaser Eftekhari, Amir H. Banihashemi, Ioannis Lambadaris
In this paper, we propose a general framework for the asymptotic analysis of node-based verification-based algorithms. In our analysis we tend the signal length to infinity. We…