Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Jinyeong Kang
Claudia Calabrese
Abdullah Almalki
Hao Mao
Peter Malec
Giovanni Venturelli
Chen Ma
Linus Scheibenreif
Radu Timofte
Kuanrui Yin
Home
/
Author
/
A. H. BANIHASHEMI
Author Info
Open Visualization
Name
Affiliation
Papers
A. H. BANIHASHEMI
Broadband Communications and Wireless Systems (BCWS) Center, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada
14
Collaborators
Citations
PageRank
19
336
29.01
Referers
Referees
References
671
299
185
Search Limit
100
671
Publications (14 rows)
Collaborators (19 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes.
7
0.55
2017
Lowering the Error Floor of LDPC Codes Using Cyclic Liftings
26
1.33
2010
Combined source and channel coding with JPEG2000 and rate-compatible low-density Parity-check codes
16
0.82
2006
Optimum space-time processors with symbol-rate sampling are bandlimited
1
0.39
2006
A 0.18-<tex>$muhbox m$</tex>CMOS Analog Min-Sum Iterative Decoder for a (32,8) Low-Density Parity-Check (LDPC) Code
27
1.62
2006
Progressive transmission of images over fading channels using rate-compatible LDPC codes.
9
0.62
2006
Optimum power allocation for a V-BLAST system with two antennas at the transmitter
13
0.86
2005
Improving Belief Propagation on Graphs With Cycles
24
2.17
2004
Iterative Layered Space-Time Receivers for Single-Carrier Transmission Over Severe Time-Dispersive Channels
68
4.20
2004
Decoding low-density parity-check codes with probabilistic scheduling
25
2.77
2001
A heuristic search for good low-density parity-check codes at short block lengths
68
6.62
2001
On the trellis complexity of root lattices and their duals
6
0.73
1999
On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
33
4.38
1998
Trellis complexity and minimal trellis diagrams of lattices
13
1.97
1998
1