IEEE International Symposium on Information Theory (ISIT)

Weight and Trapping Set Distributions for Non-Binary Regular Low-Density Parity-Check Code Ensembles

Emna Ben Yacoub

Published Jun 25, 2023• 0 citations

Abstract

The variances of weight and trapping set distributions of non-binary regular low-density parity-check ensembles are derived. Using the second moment method, bounds on the probabilities that a randomly chosen code from the ensemble has its weight and trapping set distributions close to the ensemble averages are obtained.

DOI: 10.1109/isit54713.2023.10206469

Related papers

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

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 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

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

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