Articles with public access mandates - Amir BanihashemiLearn more
Not available anywhere: 12
Symmetrical constructions for regular girth-8 QC-LDPC codes
A Tasdighi, AH Banihashemi, MR Sadeghi
IEEE Transactions on Communications 65 (1), 14-22, 2016
Mandates: Natural Sciences and Engineering Research Council of Canada
Iterative ReweightedRecovery Algorithms for Compressed Sensing of Block Sparse Signals
Z Zeinalkhani, AH Banihashemi
IEEE transactions on signal processing 63 (17), 4516-4531, 2015
Mandates: Natural Sciences and Engineering Research Council of Canada
Spatially coupled LDPC codes with small constraint length and low error floor
S Naseri, AH Banihashemi
IEEE communications letters 24 (2), 254-258, 2019
Mandates: Natural Sciences and Engineering Research Council of Canada
Construction of irregular protograph-based QC-LDPC codes with low error floor
B Karimi, AH Banihashemi
IEEE Transactions on Communications 69 (1), 3-18, 2020
Mandates: Natural Sciences and Engineering Research Council of Canada
Construction of time invariant spatially coupled LDPC codes free of small trapping sets
S Naseri, AH Banihashemi
IEEE Transactions on Communications 69 (6), 3485-3501, 2021
Mandates: Natural Sciences and Engineering Research Council of Canada
ADMM check node penalized decoders for LDPC codes
H Wei, AH Banihashemi
IEEE Transactions on Communications 69 (6), 3528-3540, 2021
Mandates: Natural Sciences and Engineering Research Council of Canada
Error floor estimation of LDPC decoders—A code independent approach to measuring the harmfulness of trapping sets
A Farsiabi, AH Banihashemi
IEEE Transactions on Communications 68 (5), 2667-2679, 2020
Mandates: Natural Sciences and Engineering Research Council of Canada
Lower bounds on the size of smallest elementary and non-elementary trapping sets in variable-regular LDPC codes
Y Hashemi, AH Banihashemi
IEEE Communications Letters 21 (9), 1905-1908, 2017
Mandates: Natural Sciences and Engineering Research Council of Canada
Counting short cycles in bipartite graphs: A fast technique/algorithm and a hardness result
A Dehghan, AH Banihashemi
IEEE Transactions on Communications 68 (3), 1378-1390, 2019
Mandates: Natural Sciences and Engineering Research Council of Canada
Tight lower and upper bounds on the minimum distance of LDPC codes
Y Hashemi, AH Banihashemi
IEEE Communications Letters 22 (1), 33-36, 2017
Mandates: Natural Sciences and Engineering Research Council of Canada
On finding bipartite graphs with a small number of short cycles and large girth
A Dehghan, AH Banihashemi
IEEE Transactions on Information Theory 66 (10), 6024-6036, 2020
Mandates: Natural Sciences and Engineering Research Council of Canada
A Semi Linear State Space Model for Error Floor Estimation of LDPC Codes Over the AWGN Channel
A Farsiabi, AH Banihashemi
IEEE Transactions on Communications 70 (11), 7075-7088, 2022
Mandates: Natural Sciences and Engineering Research Council of Canada
Available somewhere: 12
On the Tanner graph cycle distribution of random LDPC, random protograph-based LDPC, and random quasi-cyclic LDPC code ensembles
A Dehghan, AH Banihashemi
IEEE Transactions on Information Theory 64 (6), 4438-4451, 2018
Mandates: Natural Sciences and Engineering Research Council of Canada
Characterization of elementary trapping sets in irregular LDPC codes and the corresponding efficient exhaustive search algorithms
Y Hashemi, AH Banihashemi
IEEE Transactions on Information Theory 64 (5), 3411-3430, 2018
Mandates: Natural Sciences and Engineering Research Council of Canada
Construction of QC LDPC codes with low error floor by efficient systematic search and elimination of trapping sets
B Karimi, AH Banihashemi
IEEE Transactions on Communications 68 (2), 697-712, 2019
Mandates: Natural Sciences and Engineering Research Council of Canada
On computing the multiplicity of cycles in bipartite graphs using the degree distribution and the spectrum of the graph
A Dehghan, AH Banihashemi
IEEE Transactions on Information Theory 65 (6), 3778-3789, 2019
Mandates: Natural Sciences and Engineering Research Council of Canada
Hardness results on finding leafless elementary trapping sets and elementary absorbing sets of LDPC codes
A Dehghan, AH Banihashemi
IEEE Transactions on Information Theory 65 (7), 4307-4315, 2019
Mandates: Natural Sciences and Engineering Research Council of Canada
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
A Dehghan, AH Banihashemi
IEEE Transactions on Information Theory 65 (4), 2062-2074, 2018
Mandates: Natural Sciences and Engineering Research Council of Canada
Characterization and efficient search of non-elementary trapping sets of LDPC codes with applications to stopping sets
Y Hashemi, AH Banihashemi
IEEE Transactions on Information Theory 65 (2), 1017-1033, 2018
Mandates: Natural Sciences and Engineering Research Council of Canada
Asymptotic average multiplicity of structures within different categories of trapping sets, absorbing sets, and stopping sets in random regular and irregular LDPC code ensembles
A Dehghan, AH Banihashemi
IEEE Transactions on Information Theory 65 (10), 6022-6043, 2019
Mandates: Natural Sciences and Engineering Research Council of Canada
Publication and funding information is determined automatically by a computer program