IEEE International Symposium on Information Theory (ISIT)

Second Support Weight Distribution of Regular LDPC Code Ensembles

Takayuki Itsui, Kenta Kasai, Ryoji Ikegaya, Tomoharu Shibuya, Kohichi Sakaniwa

Published Jul 1, 2006• 0 citations

Abstract

The support weight distribution of a code is the number of unique subspaces of the code with specified dimension and support weight. In this paper, we formulate the average second support weight distribution and its asymptotic exponent of regular LDPC code ensembles

DOI: 10.1109/isit.2006.261666

Related papers

On the asymptotic weight distribution of regular LDPC ensembles

Vishwambhar Rathi

We estimate the variance of weight distribution of regular LDPC ensembles. Using this estimate and the second moment method we obtain bounds on the probability that a randomly chosen code from regular LDPC ensemble has its weight distribution close to the ensemble average. We are able to show that a large fraction of total number of codes have their weight distribution close to the average

IEEE International Symposium on Information Theory (ISIT)Jan 1, 200511 citations

Weight and Stopping Set Distributions of Two-Edge Type LDPC Code Ensembles

Ryoji Ikegaya

In this paper, we explicitly formulate the average weight and the stopping set distributions and their asymptotic exponents of two-edge type LDPC code ensembles. We also show some characteristics such as the symmetry and the conditions for zero of the weight distributions of two code ensembles. Further we investigate the relation between two code ensembles from the perspectives of the weight and stopping set distributions.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesOct 1, 200515 citations

On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles

Vishwambhar Rathi

In this correspondence, we estimate the variance of weight and stopping set distribution of regular low-density parity-check (LDPC) ensembles. Using this estimate and the second moment method we obtain bounds on the probability that a randomly chosen code from regular LDPC ensemble has its weight distribution and stopping set distribution close to respective ensemble averages. We are able to show that a large fraction of total number of codes have their weight and stopping set distribution close to the average

arXiv:cs/0512066IEEE Transactions on Information TheoryAug 29, 200632 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 distributions of LDPC code ensembles: combinatorics meets statistical physics

Changyan Di, Andrea Montanari A, Rudiger L. Urbanke

The exponent of the weight distribution of low-density parity-check (LDPC) code ensembles through a statistical physics method and a combinatorics method are computed in this paper. We show that the two approaches agree for regular LDPC codes. However, for irregular codes this is not necessarily the case.

IEEE International Symposium on Information Theory (ISIT)Dec 23, 200429 citations

Weight distribution for non-binary cluster LDPC code ensemble

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

In this paper, we derive the average weight distributions for the irregular non-binary cluster low-density parity-check (LDPC) code ensembles. Moreover, we give the exponential growth rate of the average weight distribution in the limit of large code length. We show that there exist (2, dc)-regular non-binary cluster LDPC code ensembles whose normalized typical minimum distances are strictly positive.

IEEE International Symposium on Information Theory (ISIT)Jul 1, 20132 citations