IEEE Transactions on Information Theory

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

Simon N. Litsyn, Vladimir Shevelev

Published Dec 1, 2003• 107 citations

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.

DOI: 10.1109/tit.2003.820012

Related papers

On ensembles of low-density parity-check codes: asymptotic distance distributions

Simon N. Litsyn, Vladimir Shevelev

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.

IEEE Transactions on Information TheoryApr 1, 2002181 citations

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

Simon N. Litsyn, Vladimir Shevelev

We derive expressions for the average distance distributions in eight ensembles of regular low-density parity-check codes using a collection of binary parity check matrices.

IEEE International Symposium on Information Theory (ISIT)Nov 13, 20022 citations

Weight distribution for non-binary cluster LDPC code ensemble

隆之野﨑, Masaki Maehara, Kenta Kasai +1 more

This paper derives the average symbol and bit weight distributions for the irregular non-binary cluster low-density parity-check (LDPC) code ensembles.Moreover, we give the exponential growth rates of the average weight distributions in the limit of large code length.We show the condition that the typical minimum distances linearly grow with the code length.

Jul 1, 20130 citations

Weight Distribution for Non-binary Cluster LDPC Code Ensemble

T. Nozaki, Masaki Maehara, Kenta Kasai +1 more

This paper derives the average symbol and bit weight distributions for the irregular non-binary cluster low-density parity-check (LDPC) code ensembles. Moreover, we give the exponential growth rates of the average weight distributions in the limit of large code length. We show the condition that the typical minimum distances linearly grow with the code length.

arXiv:1305.2480IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesJan 1, 20132 citations

Weight Distributions of Regular Low-Density Parity-Check Codes Over Finite Fields

Shengtian Yang, Thomas Honold, Yan Chen +2 more

The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approximation of the average weight distribution is derived for the small-weight case, and a series of fundamental qualitative properties of the asymptotic growth rate of the average weight distribution are proved. Based on this analysis, a general result, including all previous results as special cases, is established for the minimum distance of individual codes in a regular LDPC code ensemble.

arXiv:1010.2030IEEE Transactions on Information TheoryAug 3, 201110 citations

Weight distribution of non-binary LDPC codes

Kenta Kasai, Charly Poulliat, David Declercq +2 more

Weight distributions of binary low-density parity-check (LDPC) codes are well studied. We investigate the average distributions of symbol and binary weight for non-binary LDPC code ensemble. We derive the asymptotic growth rate and its linear approximation for small weight. Moreover, we show the typical minimum distance does not monotonically increase with the size of the field where the codes are defined.

International Symposium on Information Theory and its ApplicationsDec 1, 200817 citations