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

Detailedly Represented Irregular Low-Density Parity-Check Codes

健太 笠井, Kenta Kasai, 智治 澁谷, TOMOHARU SHIBUYA, 好一 坂庭, KOHICHI SAKANIWA

Published Oct 1, 2003• 0 citations
OpenAlex

Related papers

Detailedly Represented Irregular Low-Density Parity-Check Codes

好一 坂庭, KOHICHI SAKANIWA

•Oct 1, 2003•0 citations

Statistical physics of irregular low-density parity-check codes

祥介 樺島, Yoshiyuki Kabashima

•Jan 1, 2000•0 citations

Irregular Low-Density Parity-Check Code Design Based on Euclidean Geometries

Wataru Matsumoto

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jul 1, 2003•3 citations

Detailedly Represented Irregular Low-Density Parity-Check Codes ∗

Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa

Richardson and Urbanke developed a powerful method density evolution which determines, for various channels, the capacity of irregular low-density parity-check code ensembles. We develop generalized density evolution for minutely represented ensembles and show it includes conventional representation as a special case. Furthermore, we present an example of code ensembles used over binary erasure channel and binary input additive white Gaussian noise channel which have better thresholds than highly optimized ensembles with conventional representation. key words: density evolution, irregular low-density parity-check codes, low-density parity-check codes, belief propagation

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 1, 2003•26 citations

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

Ryoji Ikegaya, K. Kasai, T. Shibuya +1 more

In this paper, we have derived the upper bound of the average block error probability of a given detailedly represented irregular low-density parity-check (LDPC) code ensemble under maximum likelihood decoding.

IEEE Information Theory Workshop (ITW)•May 25, 2006•0 citations

Low-Density Parity-Check Codes

Marco Baldi

Springer briefs in electrical and computer engineering•Jan 1, 2014•6 citations
Richardson and Urbanke developed a powerful method density evolution which determines, for various channels, the capacity of irregular low-density parity-check code ensembles. We develop generalized density evolution for minutely represented ensembles and show it includes conventional representation as a special case. Furthermore, we present an example of code ensembles used over binary erasure channel and binary input additive white Gaussian noise channel which have better thresholds than highly optimized ensembles with conventional representation. key words: density evolution, irregular low-density parity-check codes, low-density parity-check codes, belief propagation