| Error Floor Analysis of LDPC Column Layered Decoders | 0 | 0.34 | 2022 |
| Construction of Irregular Protograph-Based QC-LDPC Codes With Low Error Floor | 2 | 0.37 | 2021 |
| Error Floor Estimation of LDPC Coded Modulation Systems Using Importance Sampling | 0 | 0.34 | 2021 |
| Error Floor Analysis of LDPC Row Layered Decoders | 0 | 0.34 | 2021 |
| ADMM Check Node Penalized Decoders for LDPC Codes | 0 | 0.34 | 2021 |
| Construction of Time Invariant Spatially Coupled LDPC Codes Free of Small Trapping Sets | 1 | 0.35 | 2021 |
| Construction of QC LDPC Codes With Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets | 0 | 0.34 | 2020 |
| Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result | 0 | 0.34 | 2020 |
| Error Floor Estimation of LDPC Decoders - A Code Independent Approach to Measuring the Harmfulness of Trapping Sets | 0 | 0.34 | 2020 |
| On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth | 0 | 0.34 | 2020 |
| Spatially Coupled LDPC Codes With Small Constraint Length and Low Error Floor. | 2 | 0.36 | 2020 |
| Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles. | 0 | 0.34 | 2019 |
| Construction of Girth-8 QC-LDPC Codes Free of Small Trapping Sets. | 2 | 0.37 | 2019 |
| Log-likelihood Ratio Calculation for Pilot Symbol Assisted Coded Modulation Schemes with Residual Phase Noise | 1 | 0.41 | 2019 |
| On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix | 0 | 0.34 | 2019 |
| Construction of QC-LDPC Codes with Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets. | 0 | 0.34 | 2019 |
| On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth | 0 | 0.34 | 2019 |
| 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. | 0 | 0.34 | 2019 |
| From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation | 0 | 0.34 | 2019 |
| On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph. | 1 | 0.35 | 2019 |
| Asymptotic Average Multiplicity of Structures within Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles | 0 | 0.34 | 2019 |
| Characterization of Elementary Trapping Sets in Irregular LDPC Codes and the Corresponding Efficient Exhaustive Search Algorithms. | 7 | 0.57 | 2018 |
| Finding Leafless Elementary Trapping Sets And Elementary Absorbing Sets Of Ldpc Codes Is Hard | 1 | 0.36 | 2018 |
| Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes. | 0 | 0.34 | 2018 |
| An Iterative Check Polytope Projection Algorithm for ADMM-Based LP Decoding of LDPC Codes. | 5 | 0.48 | 2018 |
| From Cages To Trapping Sets: A New Technique To Derive Tight Upper Bounds On The Minimum Size Of Trapping Sets And Minimum Distance Of Ldpc Codes | 0 | 0.34 | 2018 |
| Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles | 1 | 0.39 | 2018 |
| Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets. | 0 | 0.34 | 2018 |
| Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles | 0 | 0.34 | 2018 |
| On Computing the Multiplicity of Short Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph. | 0 | 0.34 | 2018 |
| On Counting Short Cycles of LDPC Codes Using the Tanner Graph Spectrum | 0 | 0.34 | 2018 |
| Asymptotic Average Number Of Different Categories Of Trapping Sets, Absorbing Sets And Stopping Sets In Random Ldpc Code Ensembles | 0 | 0.34 | 2018 |
| On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles. | 7 | 0.59 | 2018 |
| Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles. | 0 | 0.34 | 2017 |
| Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes. | 1 | 0.35 | 2017 |
| Lower Bounds on the Size of Smallest Elementary and Non-Elementary Trapping Sets in Variable-Regular LDPC Codes. | 2 | 0.39 | 2017 |
| Efficient Search of Girth-Optimal QC-LDPC Codes. | 11 | 0.66 | 2016 |
| New Characterization and Efficient Exhaustive Search Algorithm for Leafless Elementary Trapping Sets of Variable-Regular LDPC Codes. | 11 | 0.94 | 2016 |
| An Efficient Exhaustive Search Algorithm For Elementary Trapping Sets Of Variable-Regular Ldpc Codes | 0 | 0.34 | 2016 |
| On Weighting/Reweighting Schemes For Approximate Message Passing Algorithms | 0 | 0.34 | 2016 |
| Corrections to "On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes". | 0 | 0.34 | 2015 |
| Energy-Efficient Broadcasting for Cross Wireless Ad-Hoc Networks. | 0 | 0.34 | 2015 |
| Ultra Low-Complexity Detection of Spectrum Holes in Compressed Wideband Spectrum Sensing | 1 | 0.35 | 2015 |
| Iterative Reweighted ℓ2/ℓ1 Recovery Algorithms for Compressed Sensing of Block Sparse Signals. | 0 | 0.34 | 2015 |
| Lowering the Error Floor of LDPC Codes Using Multi-Step Quantization. | 2 | 0.39 | 2014 |
| Message-Passing Algorithms for Counting Short Cycles in a Graph. | 12 | 0.81 | 2013 |
| Error Rate Estimation of Low-Density Parity-Check Codes Decoded by Quantized Soft-Decision Iterative Algorithms | 3 | 0.43 | 2013 |
| Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay | 0 | 0.34 | 2012 |
| Coding delay analysis of Chunked codes over line networks. | 1 | 0.36 | 2012 |
| Performance Analysis of Iterative Decoding Algorithms with Memory over Memoryless Channels. | 0 | 0.34 | 2012 |
