◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Banihashemi

36 papers hereh-index 354.1k citations189 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author9
  • last author27

Across the 36 of 36 papers where every author was matched, so the position is known.

fields
  • cs.IT31
  • cs.DM2
  • cs.NI2
  • eess.SP1

identity via Semantic Scholar / OpenAlex

activity
20072021
most citedDesign of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings

26 citations · 66 across the 31 of their papers we have counts for

collaborators
Showing 2019Show all

3 papers · 1 filter

cs.DM2019

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

Ali Dehghan, Amir H. Banihashemi

Finding the multiplicity of cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) code…

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.