IEEE Transactions on Information Theory

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

Simon N. Litsyn, Vladimir Shevelev

Published Apr 1, 2002• 181 citations

Abstract

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.

DOI: 10.1109/18.992777

Related papers

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

Simon N. Litsyn, Vladimir Shevelev

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.

IEEE Transactions on Information TheoryDec 1, 2003107 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

Average Coset Weight Distributions of Gallager's LDPC Code Ensemble

Tadashi Wadayama

In this correspondence, the average coset weight distributions of Gallager's low-density parity-check (LDPC) code ensemble are investigated. Gallager's LDPC code ensemble consists of regular mtimesn-LDPC matrices with column weight j and row weight k. The average coset weight distribution can be derived by enumerating the number of parity-check matrices in the ensemble satisfying certain conditions. Based on combinatorial arguments, a formula for the average coset weight distribution will be proved. From the formula, we can show some properties of the average coset weight distributions such as equivalence classes of syndromes, symmetry of the distributions, and a lower bound on coset weight

IEEE Transactions on Information TheoryJun 28, 20055 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 Low-Density Parity-Check Codes

C. Di, Tom Richardson, Rudiger L. Urbanke

We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code ensembles. We show that the growth rate of the minimum distance of LDPC codes depends only on the degree distribution pair. It turns out that capacity-achieving sequences of standard (unstructured) LDPC codes under iterative decoding over the binary erasure channel (BEC) known to date have sublinearly growing minimum distance in the block length

IEEE Transactions on Information TheoryOct 30, 2006176 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