Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Capacity-approaching protograph codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
A channel representation method for the study of hybrid retransmission-based error control
IEEE Transactions on Communications
Finding all small error-prone substructures in LDPC codes
IEEE Transactions on Information Theory
Upper bound on error exponent of regular LDPC codes transmitted over the BEC
IEEE Transactions on Information Theory
Sublinear compressive sensing reconstruction via belief propagation decoding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Low-density graph codes that are optimal for binning and coding with side information
IEEE Transactions on Information Theory
Some mysterious sequences associated with LDPC codes
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Message passing resource allocation for the uplink of multicarrier systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On the undetected error probability of binary matrix ensembles
IEEE Transactions on Information Theory
Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding
IEEE Transactions on Information Theory
Protograph LDPC codes over burst erasure channels
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
| Hi-index | 755.14 |
We derive expressions for the average distance distributions in several ensembles of regular low-density parity-check codes (LDPC). Among these ensembles are the standard one defined by matrices having given column and row sums, ensembles defined by matrices with given column sums or given row sums, and an ensemble defined by bipartite graphs