Cambridge University Press eBooks

Weight Distribution and Minimum Distance of LDPC Codes

Enrico Paolini, Gianluigi Liva, Balázs Matuz, Marco Chiani

Published Feb 25, 2026• 0 citations

Abstract

Weight distribution of LDPC codes: More advanced topics on LDPC codes are covered by Chapter 5, which is focused on structural properties of these codes related to their weight distributions. This chapter addresses weight distributions of unstructured and partially structured LDPC code ensembles as well as weight distribution exponents. It also addresses ensemble expurgation and minimum distance analysis for LDPC codes.

DOI: 10.1017/9781316443354.006

Related papers

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

Ensemble Weight Enumerators for Protograph LDPC Codes

D. Divsalar

Recently, LDPC codes with projected graph, or protograph structures have been proposed. In this paper, finite length ensemble weight enumerators for LDPC codes with protograph structures are obtained. Asymptotic results are derived as the block size goes to infinity. In particular, we are interested in obtaining ensemble average weight enumerators for protograph LDPC codes which have typical minimum distance that grows linearly with block size. As with irregular ensembles, linear minimum distance property is sensitive to the proportion of degree-2 variable nodes. In this paper, the derived results on ensemble weight enumerators show that linear minimum distance condition on degree distribution of unstructured irregular LDPC codes is a sufficient but not a necessary condition for protograph LDPC codes

IEEE International Symposium on Information Theory (ISIT)Jul 1, 200667 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 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 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