| Publication | Date of Publication | Type |
|---|
Error Floor Analysis of LDPC Row Layered Decoders
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
Graphs and Combinatorics | 2020-01-21 | Paper |
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
On computing the multiplicity of cycles in bipartite graphs using the degree distribution and the spectrum of the graph
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
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
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes With Applications to Stopping Sets
IEEE Transactions on Information Theory | 2019-01-28 | Paper |
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Characterization of Elementary Trapping Sets in Irregular LDPC Codes and the Corresponding Efficient Exhaustive Search Algorithms
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Iterative Reweighted <formula formulatype="inline"><tex Notation="TeX">$\ell_{2}/\ell_{1}$</tex> </formula> Recovery Algorithms for Compressed Sensing of Block Sparse Signals
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Combined source and channel coding with JPEG2000 and rate-compatible low-density Parity-check codes
IEEE Transactions on Signal Processing | 2017-10-30 | Paper |
Optimum space-time processors with symbol-rate sampling are bandlimited
IEEE Transactions on Signal Processing | 2017-10-30 | Paper |
Lowering the Error Floor of LDPC Codes Using Cyclic Liftings
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On the Girth of Quasi-Cyclic Protograph LDPC Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Corrections to “On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes” [Sep 14 5188-5203]
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Efficient Search of Girth-Optimal QC-LDPC Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
New Characterization and Efficient Exhaustive Search Algorithm for Leafless Elementary Trapping Sets of Variable-Regular LDPC Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Low-Density Parity-Check Lattices: Construction and Decoding Analysis
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Tanner graphs for group block codes and lattices: construction and complexity
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
On the trellis complexity of root lattices and their duals
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Trellis complexity and minimal trellis diagrams of lattices
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
An inequality on the coding gain of densest lattice packings in successive dimensions
Designs, Codes and Cryptography | 1999-04-16 | Paper |
On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
IEEE Transactions on Information Theory | 1998-01-01 | Paper |
