Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

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

Simon N. Litsyn, Vladimir Shevelev

Published Nov 13, 2002• 2 citations
Publisher

Abstract

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.
DOI
10.1109/isit.2001.935912

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 Theory•Dec 1, 2003•104 citations

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 Theory•Apr 1, 2002•173 citations

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

Emna Ben Yacoub

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.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•0 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 Applications•Dec 1, 2008•18 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 Theory•Oct 30, 2006•172 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.2480•IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2013•2 citations