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

IEICE technical report. Information theory

Concentration of the Decoding Performance for Detailedly Represented Irregular LDPC Code Ensembles

Satoshi Shimada, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa

Published Mar 9, 2004• 0 citations
OpenAlex

Related papers

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

好一 坂庭, KOHICHI SAKANIWA

•Mar 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

Asymptotic Analysis of Weight Distribution for Detailedly Represented Irregular LDPC Code Ensembles

好一 坂庭, KOHICHI SAKANIWA

•Jan 1, 2003•0 citations

Asymptotic Stopping Set Distribution for Detailedly Represented Irregular LDPC Code Ensembles

Ryoji Ikegaya, Kenta Kasai, Tomoharu Shibuya +1 more

IEEE International Symposium on Information Theory (ISIT)•Dec 15, 2003•0 citations

Asymptotic Weight and Stopping Set Distributions for Detailedly Represented Irregular LDPC Code Ensembles

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

•Jan 1, 2004•0 citations

Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles

Ryoji Ikegaya, Kenta Kasai, Tomoharu Shibuya +1 more

This work presents an ensemble of irregular low-density parity check (LDPC) codes based on an ensemble of bipartite graphs, which formulated the average weight distribution. An analysis of the error performance of LDPC codes over a binary erasure channel together with an iterative decoding algorithm based on belief propagation has been clarified that a notion of stopping sets and their distribution with the asymptotic expression are derived. An irregular LDPC code ensemble that exhibits better performance in the sense of threshold is obtained by density evolution and explicitly formulates weight and stopping set distributions are defined.

IEEE International Symposium on Information Theory (ISIT)•Dec 23, 2004•18 citations
This work presents an ensemble of irregular low-density parity check (LDPC) codes based on an ensemble of bipartite graphs, which formulated the average weight distribution. An analysis of the error performance of LDPC codes over a binary erasure channel together with an iterative decoding algorithm based on belief propagation has been clarified that a notion of stopping sets and their distribution with the asymptotic expression are derived. An irregular LDPC code ensemble that exhibits better performance in the sense of threshold is obtained by density evolution and explicitly formulates weight and stopping set distributions are defined.