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)

Finite-length analysis of LDPC codes with large left degrees

Junan Zhang, Alon Orlitsky

Published Jun 25, 2003• 30 citations
Publisher

Abstract

Extending the results of Proietti et al. (see IEEE Trans. on Information Theory, vol.48, June 2002) we derive a recursion for calculating the average error probability of random bipartite graph ensembles of LDPC codes with large left degrees over erasure channels.
DOI
10.1109/isit.2002.1023275

Related papers

Stopping Set Distribution of LDPC Code Ensembles

Alon Orlitsky, K. Viswanathan, J. Zhang

Stopping sets determine the performance of low-density parity-check (LDPC) codes under iterative decoding over erasure channels. We derive several results on the asymptotic behavior of stopping sets in Tanner-graph ensembles, including the following. An expression for the normalized average stopping set distribution, yielding, in particular, a critical fraction of the block length above which codes have exponentially many stopping sets of that size. A relation between the degree distribution and the likely size of the smallest nonempty stopping set, showing that for a /spl radic/1-/spl lambda/'(0)/spl rho/'(1) fraction of codes with /spl lambda/'(0)/spl rho/'(1)2, the smallest nonempty stopping set is linear in the block length. Bounds on the average block error probability as a function of the erasure probability /spl epsi/, showing in particular that for codes with lowest variable degree 2, if /spl epsi/ is below a certain threshold, the asymptotic average block error probability is 1-/spl radic/1-/spl lambda/'(0)/spl rho/'(1)/spl epsi/.

IEEE Transactions on Information Theory•Feb 28, 2005•218 citations

Finite-length analysis of irregular expurgated LDPC codes under finite number of iterations

Ryuhei Mori, Toshiyuki Tanaka, Kenta Kasai +1 more

Communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) codes and belief propagation (BP) decoding is considered. The average bit error probability of an irregular LDPC code ensemble after a fixed number of iterations converges to a limit, which is calculated via density evolution, as the blocklength n tends to infinity. The difference between the bit error probability with blocklength n and the large-blocklength limit behaves asymptotically like ¿/n, where the coefficient ¿ depends on the ensemble, the number of iterations and the erasure probability of the BEC. In, ¿ is calculated for regular ensembles. In this paper, ¿ for irregular expurgated ensembles is derived. It is demonstrated that convergence of numerical estimates of ¿ to the analytic result is significantly fast for irregular unexpurgated ensembles.

arXiv:0901.2204•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•2 citations

Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Number of Iterations

立平 森, Ryuuhei Mori, 健太 笠井 +5 more

•Jul 1, 2008•0 citations

Detailed evolution of degree distributions in residual graphs with joint degree distributions

隆之 野﨑, Kenta Kasai, TOMOHARU SHIBUYA +1 more

Luby et al. derived evolution of degree distributions in residual graphs for irregular LDPC code ensembles.Evolution of degree distributions in residual graphs is important characteristic which is used for finite-length analysis of the expected block and bit error probability over the binary erasure channel.In this paper, we derive detailed evolution of degree distributions in residual graphs for irregular LDPC code ensembles with joint degree distributions.

•Jul 1, 2008•0 citations

Analysis of decoding error probability for finite length LDPC codes ; 有限長の低密度パリティ検査符号の復号誤り率の解析

T. Nozaki, Takayuki Nozaki

•Jan 1, 2016•0 citations

Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions

T. Nozaki, K. KASAI, T. SHIBUYA +1 more

Luby et al. derived evolution of degree distributions in residual graphs for irregular LDPC code ensembles. Evolution of degree distributions in residual graphs is important characteristic which is used for finite-length analysis of the expected block and bit error probability over the binary erasure channel. In this paper, we derive detailed evolution of degree distributions in residual graphs for irregular LDPC code ensembles with joint degree distributions.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 1, 2008•0 citations
Stopping sets determine the performance of low-density parity-check (LDPC) codes under iterative decoding over erasure channels. We derive several results on the asymptotic behavior of stopping sets in Tanner-graph ensembles, including the following. An expression for the normalized average stopping set distribution, yielding, in particular, a critical fraction of the block length above which codes have exponentially many stopping sets of that size. A relation between the degree distribution and the likely size of the smallest nonempty stopping set, showing that for a /spl radic/1-/spl lambda/'(0)/spl rho/'(1) fraction of codes with /spl lambda/'(0)/spl rho/'(1)2, the smallest nonempty stopping set is linear in the block length. Bounds on the average block error probability as a function of the erasure probability /spl epsi/, showing in particular that for codes with lowest variable degree 2, if /spl epsi/ is below a certain threshold, the asymptotic average block error probability is 1-/spl radic/1-/spl lambda/'(0)/spl rho/'(1)/spl epsi/.
Communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) codes and belief propagation (BP) decoding is considered. The average bit error probability of an irregular LDPC code ensemble after a fixed number of iterations converges to a limit, which is calculated via density evolution, as the blocklength n tends to infinity. The difference between the bit error probability with blocklength n and the large-blocklength limit behaves asymptotically like ¿/n, where the coefficient ¿ depends on the ensemble, the number of iterations and the erasure probability of the BEC. In, ¿ is calculated for regular ensembles. In this paper, ¿ for irregular expurgated ensembles is derived. It is demonstrated that convergence of numerical estimates of ¿ to the analytic result is significantly fast for irregular unexpurgated ensembles.