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)

Tight Bounds of Minimum Distance Distributions of Irregular LDPC Code Ensembles

Shinya Miyamoto, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa

Published Jun 1, 2007• 0 citations
Publisher

Abstract

Upper bounds of minimum distance distributions of Gallger codes and irregular LDPC codes were derived by Callage and Di, respectively. Di's bounds are tight for irregular LDPC codes which have variable nodes of degree two, however, it is not tight for irregular LDPC codes which do not. In this paper, we derive tight lower and upper bounds of minimum distance distributions of irregular LDPC code ensembles without variable nodes of degree two.

DOI
10.1109/isit.2007.4557315

Related papers

Minimum distance distribution of irregular generalized LDPC code ensembles

Ian P. Mulholland, Mark F. Flanagan, Enrico Paolini

In this paper, the minimum distance distribution of irregular generalized LDPC (GLDPC) code ensembles is investigated. Two classes of GLDPC code ensembles are analyzed; in one case, the Tanner graph is regular from the variable node perspective, and in the other case the Tanner graph is completely unstructured and irregular. In particular, for the former ensemble class we determine exactly which ensembles have minimum distance growing linearly with the block length with probability approaching unity with increasing block length. This work extends previous results concerning LDPC and regular GLDPC codes to the case where a hybrid mixture of check node types is used.

arXiv:1302.0522•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2013•1 citation

Distance spectrum of right-regular low-density parity-check codes: derivation and discussion of numerical results

Mahmoud Rashidpour, S. Hamidreza Jamali

The asymptotic distance distribution of regular low-density parity-check (LDPC) codes derived by Litsin and Sherlev (2002) is generalised for the case of irregular LDPC codes with constant check node degree. Numerical analysis of simple irregular LDPC codes with weight-two variable nodes shows that their minimum Hamming distance can be increased linearly with the code length when the maximum variable node degree of the code is kept below a critical value. This result is consistent with the stability condition of the LDPC codes, at least for the simple irregular case.

IEE Proceedings - Communications•Jan 1, 2005•0 citations

Low Complexity Bounds on a Class of Irregular LDPC Belief-Propagation Decoding Thresholds

F. Vatta, Alessandro Soranzo, Massimiliano Comisso +2 more

This paper investigates about the usefulness of a recently published low complexity upper bound on beliefpropagation decoding thresholds for a class of irregular lowdensity parity-check (LDPC) codes. In particular, the class considered is characterized by variable node degree distributions λ(x) of minimum degree ${i_1}$ >2: being, in this case, $\lambda^{\prime}$(0)=$\lambda_{2}=0$, this is useful to design LDPC codes presenting a linear minimum distance growth with the block length with probability 1, as shown in Di et al.’s 2006 paper. These codes unfortunately cannot reach capacity under iterative decoding, since the achievement of capacity requires $\lambda_{2}\neq0$. However, in this latter case, the block error probability might converge to a constant, as shown in the aforementioned paper.

International Conference on Software, Telecommunications and Computer Networks (SoftCOM)•Sep 17, 2020•1 citation

An upper bound on the minimum distance of array low-density parity-check codes

Eirik Rosnes, Marcel Ambroze, Martin Tomlinson

In this work, we present an upper bound on the minimum distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m ≤ q. In the literature, the minimum distance of these codes (denoted by d(q,m)) has been thoroughly studied for m ≤ 5. Both exact results, for small values of q and m, and general (i.e., independent of q) bounds have been established. For m ≤ 6, the best known minimum distance upper bound, derived by Mittelholzer (IEEE Int. Symp. Inf. Theory, Jun./Jul. 2002), is d(q, 6) ≤ 32. In this work, we derive an improved upper bound of d(q, 6) ≤ 20 by using the concept of a template support matrix of a codeword. The bound is tight with high probability in the sense that we have not been able to find codewords of strictly lower weight for several values of q using a minimum distance probabilistic algorithm. Finally, we provide new specific minimum distance results for m ≤ 6 and low-to-moderate values of q ≤ 79.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•0 citations

Generalization of Tanner′s Minimum Distance Bounds for LDPC Codes

Shin Min Ho, 김준성, Song Hong-Yeop

LDPC(Low Density Parity Check) codes are described by bipartite graphs with bit nodes and parity-check nodes. Tanner derived minimum distance bounds of the regular LDPC code in terms of the eigenvalues of the associated adjacency matrix. In this paper we generalize the Tanner's results. We derive minimum distance bounds applicable to both regular and blockwise-irregular LDPC codes. The first bound considers the relation between bit nodes in a minimum-weight codeword, and the second one considers the connectivity between parity nodes adjacent to a minimum-weight codeword. The derived bounds make it possible to describe the distance property of the code in terms of the eigenvalues of the associated matrix.

한국통신학회논문지•Jan 1, 2004•0 citations

Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes

Yoones Hashemi, Amir H. Banihashemi

In this letter, we obtain lower and upper bounds on the minimum distance dminof low-density parity-check (LDPC) codes. The bounds are derived by categorizing the non-zero code words of an LDPC code into two categories of elementary and non-elementary. The first category contains code words whose induced subgraph has only degree-2 check nodes. We propose an efficient search algorithm that can find the elementary code words of an LDPC code with weight less than a certain value amax, exhaustively. We also derive a lower bound Lneon the weight of non-elementary code words. By performing the search with amax= Lne, we either obtain an elementary code word with the smallest weight dmin, or establish the lower bound of Lneon dmin. For the upper bound, we modify our search algorithm to reach elementary codewords of larger weights at the cost of being non-exhaustive. Once such a codeword is found, its weight acts as an upper bound on dmin. We examine a large number of regular and irregular LDPC codes, and demonstrate the efficiency and versatility of our technique in finding lower and upper bounds on, and in many cases the exact value of, dmin. Finding dmin, or establishing search-based lower or upper bounds, for many of the examined codes are out of the reach of any existing algorithm.

IEEE Communications Letters•Nov 1, 2017•11 citations
Upper bounds of minimum distance distributions of Gallger codes and irregular LDPC codes were derived by Callage and Di, respectively. Di's bounds are tight for irregular LDPC codes which have variable nodes of degree two, however, it is not tight for irregular LDPC codes which do not. In this paper, we derive tight lower and upper bounds of minimum distance distributions of irregular LDPC code ensembles without variable nodes of degree two.
In this paper, the minimum distance distribution of irregular generalized LDPC (GLDPC) code ensembles is investigated. Two classes of GLDPC code ensembles are analyzed; in one case, the Tanner graph is regular from the variable node perspective, and in the other case the Tanner graph is completely unstructured and irregular. In particular, for the former ensemble class we determine exactly which ensembles have minimum distance growing linearly with the block length with probability approaching unity with increasing block length. This work extends previous results concerning LDPC and regular GLDPC codes to the case where a hybrid mixture of check node types is used.
The asymptotic distance distribution of regular low-density parity-check (LDPC) codes derived by Litsin and Sherlev (2002) is generalised for the case of irregular LDPC codes with constant check node degree. Numerical analysis of simple irregular LDPC codes with weight-two variable nodes shows that their minimum Hamming distance can be increased linearly with the code length when the maximum variable node degree of the code is kept below a critical value. This result is consistent with the stability condition of the LDPC codes, at least for the simple irregular case.
This paper investigates about the usefulness of a recently published low complexity upper bound on beliefpropagation decoding thresholds for a class of irregular lowdensity parity-check (LDPC) codes. In particular, the class considered is characterized by variable node degree distributions λ(x) of minimum degree i1{i_1}i1​ >2: being, in this case, λ′\lambda^{\prime}λ′(0)=λ2=0\lambda_{2}=0λ2​=0, this is useful to design LDPC codes presenting a linear minimum distance growth with the block length with probability 1, as shown in Di et al.’s 2006 paper. These codes unfortunately cannot reach capacity under iterative decoding, since the achievement of capacity requires λ2≠0\lambda_{2}\neq0λ2​=0. However, in this latter case, the block error probability might converge to a constant, as shown in the aforementioned paper.
In this work, we present an upper bound on the minimum distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m ≤ q. In the literature, the minimum distance of these codes (denoted by d(q,m)) has been thoroughly studied for m ≤ 5. Both exact results, for small values of q and m, and general (i.e., independent of q) bounds have been established. For m ≤ 6, the best known minimum distance upper bound, derived by Mittelholzer (IEEE Int. Symp. Inf. Theory, Jun./Jul. 2002), is d(q, 6) ≤ 32. In this work, we derive an improved upper bound of d(q, 6) ≤ 20 by using the concept of a template support matrix of a codeword. The bound is tight with high probability in the sense that we have not been able to find codewords of strictly lower weight for several values of q using a minimum distance probabilistic algorithm. Finally, we provide new specific minimum distance results for m ≤ 6 and low-to-moderate values of q ≤ 79.
LDPC(Low Density Parity Check) codes are described by bipartite graphs with bit nodes and parity-check nodes. Tanner derived minimum distance bounds of the regular LDPC code in terms of the eigenvalues of the associated adjacency matrix. In this paper we generalize the Tanner's results. We derive minimum distance bounds applicable to both regular and blockwise-irregular LDPC codes. The first bound considers the relation between bit nodes in a minimum-weight codeword, and the second one considers the connectivity between parity nodes adjacent to a minimum-weight codeword. The derived bounds make it possible to describe the distance property of the code in terms of the eigenvalues of the associated matrix.
In this letter, we obtain lower and upper bounds on the minimum distance dminof low-density parity-check (LDPC) codes. The bounds are derived by categorizing the non-zero code words of an LDPC code into two categories of elementary and non-elementary. The first category contains code words whose induced subgraph has only degree-2 check nodes. We propose an efficient search algorithm that can find the elementary code words of an LDPC code with weight less than a certain value amax, exhaustively. We also derive a lower bound Lneon the weight of non-elementary code words. By performing the search with amax= Lne, we either obtain an elementary code word with the smallest weight dmin, or establish the lower bound of Lneon dmin. For the upper bound, we modify our search algorithm to reach elementary codewords of larger weights at the cost of being non-exhaustive. Once such a codeword is found, its weight acts as an upper bound on dmin. We examine a large number of regular and irregular LDPC codes, and demonstrate the efficiency and versatility of our technique in finding lower and upper bounds on, and in many cases the exact value of, dmin. Finding dmin, or establishing search-based lower or upper bounds, for many of the examined codes are out of the reach of any existing algorithm.