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)

Stopping Set Distributions of IRA and IRA Type LDPC Code Ensembles

Ryoji Ikegaya, Kenta Kasai, Yuji Shimoyama, Tomoharu Shibuya, Kohichi Sakaniwa

Published Dec 14, 2004• 0 citations
OpenAlex

Related papers

Stopping Set Distributions of Two-Edge Type LDPC Code Ensembles

好一 坂庭, KOHICHI SAKANIWA

•Sep 1, 2005•0 citations

Weight and stopping set distributions of irregular LDPC code ensembles

亮志 池谷

•Jan 1, 2006•1 citation

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

Weight and Stopping Set Distributions of Two-Edge Type LDPC Code Ensembles

Ryoji Ikegaya

In this paper, we explicitly formulate the average weight and the stopping set distributions and their asymptotic exponents of two-edge type LDPC code ensembles. We also show some characteristics such as the symmetry and the conditions for zero of the weight distributions of two code ensembles. Further we investigate the relation between two code ensembles from the perspectives of the weight and stopping set distributions.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 1, 2005•15 citations

Stopping set distributions of two-edge type LDPC code ensembles

Ryoji Ikegaya, Kazuhiko Kasai, Yuji Shimoyama +2 more

In this paper, we explicitly formulate the average stopping set distributions and their asymptotic exponents of two instances of two-edge type LDPC code ensembles. Further we investigate the relation between the asymptotic exponents of those two code ensembles

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•3 citations