Distance distributions in ensembles of irregular low-density parity-check codes

Authors:
S. Litsyn;V. Shevelev
Affiliations:
Dept. of Electr. Eng.-Syst., Tel Aviv Univ., Ramat-Aviv, Israel;-
Venue:
IEEE Transactions on Information Theory
Year:
2003

Citing 0
Cited 5

Capacity-approaching protograph codes

IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Finding all small error-prone substructures in LDPC codes

IEEE Transactions on Information Theory
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
Protograph LDPC codes over burst erasure channels

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications

Quantified Score

Hi-index	754.96

Visualization

Abstract

We derive asymptotic expressions for the average distance distributions in ensembles of irregular low-density parity-check (LDPC) codes. The ensembles are defined by matrices with given profiles of column and row sums.