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 Transactions on Communications

Minimum distance lower bounds for girth-constrained RA code ensembles

Weigang Chen, Liuguo Yin, Jianhua Lü

Published Jun 1, 2010• 4 citations
Publisher

Abstract

Minimum distance lower bounds are derived using graphical enumeration and integer programming for girth-constrained repeat-accumulate (RA) code ensembles. Moreover, the worst subgraphs in Tanner graphs leading to the minimum distance lower bounds and the probabilities they occur are analyzed.
DOI
10.1109/tcomm.2010.06.070652

Related papers

Several Properties of Short LDPC Codes

We present several properties on minimum distance $(d_min)$ and girth $(G_min)$ in Tanner graphs for low-density parity-check (LDPC) codes with small left degrees. We show that the distance growth of (2, 4) LDPC codes is too slow to achieve the desired performance. We further give a tight upper bound on the maximum possible girth. The numerical results show that codes with large $G_min$ could outperform the average performance of regular ensembles of the LDPC codes over binary symmetric channels. The same codes perform about 1.5 dB away from the sphere-packing bound on additive white Gaussian noise channels.

IEEE Transactions on Communications•Apr 1, 2004•0 citations

Generalization of Tanner's minimum distance bounds for LDPC codes

Min-Ho Shin, Joon-Sung Kim, Hong‐Yeop Song

Tanner derived minimum distance bounds of regular codes in terms of the eigenvalues of the adjacency matrix by using some graphical analysis on the associated graph of the code. In this letter, we generalize Tanner's results by deriving a bit-oriented bound and a parity-oriented bound on the minimum distances of both regular and block-wise irregular LDPC codes.

IEEE Communications Letters•Mar 1, 2005•7 citations

Codes on planar Tanner graphs

Srimathy Srinivasan, Andrew Thangaraj

Codes defined on graphs and their properties have been subjects of intense recent research. In this work, we are concerned with codes that have planar Tanner graphs. When the Tanner graph is planar, message-passing decoders can be efficiently implemented on chips without any issues of wiring. Also, recent work has shown the existence of optimal decoders for certain planar graphical models. The main contribution of this paper is an explicit upper bound on minimum distance $d$ of codes that have planar Tanner graphs as a function of the code rate $R$ for $R \geq 5/8$. The bound is given by\begin{equation*}d\le \left\lceil \frac{7-8R}{2(2R-1)} \right\rceil + 3\le 7.\end{equation*}As a result, high-rate codes with planar Tanner graphs will result in poor block-error rate performance, because of the constant upper bound on minimum distance.

Advances in Mathematics of Communications•Jan 1, 2012•0 citations

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•2 citations

Several Properties of Short LDPC Codes

Lei Wei

In this paper, we present several properties on minimum distance(d/sub min/) and girth(G/sub min/) in Tanner graphs for low-density parity-check (LDPC) codes with small left degrees. We show that the distance growth of (2, 4) LDPC codes is too slow to achieve the desired performance. We further give a tight upper bound on the maximum possible girth. The numerical results show that codes with large G/sub min/ could outperform the average performance of regular ensembles of the LDPC codes over binary symmetric channels. The same codes perform about 1.5 dB away from the sphere-packing bound on additive white Gaussian noise channels.

IEEE Transactions on Communications•May 1, 2004•23 citations

Lower bounds on the spectrum and error rate LDPC code ensembles

Ohad Barak, David Burshtein

We consider the ensemble of regular LDPC codes and obtain an expression for the second moment of the distance spectrum. We show how this expression can be used to derive a lower bound on the probability that the growth rate of a randomly chosen code from the ensemble is equal to the growth rate of the average distance spectrum, when the block length is sufficiently large. In particular, when the connectivity of the code is sufficiently large, the distance spectrum of a code in the ensemble is concentrated. We then derive a lower bound on the probability (confidence level) that the minimum distance and error rate, respectively, of a randomly chosen code from the ensemble are upper and lower bounded by some values (which depend on the confidence level)

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•8 citations
We present several properties on minimum distance (dmin)(d_min)(dm​in) and girth (Gmin)(G_min)(Gm​in) in Tanner graphs for low-density parity-check (LDPC) codes with small left degrees. We show that the distance growth of (2, 4) LDPC codes is too slow to achieve the desired performance. We further give a tight upper bound on the maximum possible girth. The numerical results show that codes with large GminG_minGm​in could outperform the average performance of regular ensembles of the LDPC codes over binary symmetric channels. The same codes perform about 1.5 dB away from the sphere-packing bound on additive white Gaussian noise channels.
Codes defined on graphs and their properties have been subjects of intense recent research. In this work, we are concerned with codes that have planar Tanner graphs. When the Tanner graph is planar, message-passing decoders can be efficiently implemented on chips without any issues of wiring. Also, recent work has shown the existence of optimal decoders for certain planar graphical models. The main contribution of this paper is an explicit upper bound on minimum distance ddd of codes that have planar Tanner graphs as a function of the code rate RRR for R≥5/8R \geq 5/8R≥5/8. The bound is given by\begin{equation*}d\le \left\lceil \frac{7-8R}{2(2R-1)} \right\rceil + 3\le 7.\end{equation*}As a result, high-rate codes with planar Tanner graphs will result in poor block-error rate performance, because of the constant upper bound on minimum distance.
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.
In this paper, we present several properties on minimum distance(d/sub min/) and girth(G/sub min/) in Tanner graphs for low-density parity-check (LDPC) codes with small left degrees. We show that the distance growth of (2, 4) LDPC codes is too slow to achieve the desired performance. We further give a tight upper bound on the maximum possible girth. The numerical results show that codes with large G/sub min/ could outperform the average performance of regular ensembles of the LDPC codes over binary symmetric channels. The same codes perform about 1.5 dB away from the sphere-packing bound on additive white Gaussian noise channels.
We consider the ensemble of regular LDPC codes and obtain an expression for the second moment of the distance spectrum. We show how this expression can be used to derive a lower bound on the probability that the growth rate of a randomly chosen code from the ensemble is equal to the growth rate of the average distance spectrum, when the block length is sufficiently large. In particular, when the connectivity of the code is sufficiently large, the distance spectrum of a code in the ensemble is concentrated. We then derive a lower bound on the probability (confidence level) that the minimum distance and error rate, respectively, of a randomly chosen code from the ensemble are upper and lower bounded by some values (which depend on the confidence level)