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

Performance of Standard Irregular LDPC Codes under Maximum Likelihood Decoding

健太 笠井, Kenta Kasai

Published Aug 1, 2006• 0 citations
OpenAlex

Related papers

Average Error Probability of Standard Irregular LDPC Code Ensemble under Maximum Likelihood Decoding

Ryoji Ikegaya, Kenta Kasai, Tomoharu Shibuya +1 more

IEEE International Symposium on Information Theory (ISIT)•Nov 20, 2005•2 citations

Upper Bounds of Block Error Probability of Standard Irregular LDPC Code Ensemble under Maximum Likelihood Decoding

Ryoji Ikegaya, Kenta Kasai, Tomoharu Shibuya +1 more

•Apr 3, 2006•1 citation

Upper Bounds of Block Error Probability of Standard Irregular LDPC Code Ensemble under Maximum Likelihood Decoding

亮志 池谷, Ikegaya Ryoji, 健太 笠井 +5 more

•Apr 1, 2006•0 citations

The Block Error Probability of Detailedly Represented Irregular LDPC Code Ensembles Under Maximum Likelihood Decoding

健太 笠井, Kenta Kasai

•Mar 1, 2006•0 citations

The Block Error Probability of Detailedly Represented Irregular LDPC Code Ensembles Under Maximum Likelihood Decoding

好一 坂庭, KOHICHI SAKANIWA

•Mar 1, 2006•0 citations

Performance of Standard Irregular LDPC Codes under Maximum Likelihood Decoding

Ryoji Ikegaya, K. KASAI, T. SHIBUYA +1 more

In this paper, we derive an upper bound for the average block error probability of a standard irregular low-density parity-check (LDPC) code ensemble under the maximum-likelihood (ML) decoding. Moreover, we show that the upper bound asymptotically decreases polynomially with the code length. Furthermore, when we consider several regular LDPC code ensembles as special cases of standard irregular ones over an additive white Gaussian noise channel, we numerically show that the signal-to-noise ratio (SNR) thresholds at which the proposed bound converges to zero as the code length tends to infinity are smaller than those for a bound provided by Miller et al. We also give an example of a standard irregular LDPC code ensemble which has a lower SNR threshold than a given regular LDPC code ensemble.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jul 1, 2007•4 citations
In this paper, we derive an upper bound for the average block error probability of a standard irregular low-density parity-check (LDPC) code ensemble under the maximum-likelihood (ML) decoding. Moreover, we show that the upper bound asymptotically decreases polynomially with the code length. Furthermore, when we consider several regular LDPC code ensembles as special cases of standard irregular ones over an additive white Gaussian noise channel, we numerically show that the signal-to-noise ratio (SNR) thresholds at which the proposed bound converges to zero as the code length tends to infinity are smaller than those for a bound provided by Miller et al. We also give an example of a standard irregular LDPC code ensemble which has a lower SNR threshold than a given regular LDPC code ensemble.