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)

Detailed representation of irregular LDPC code ensembles and density evolution

Kazuhiko Kasai, T. Shibuya, K. Sakaniwa

Published Jan 1, 2003• 12 citations
Publisher

Abstract

We construct new families of low-density parity-check (LDPC) code ensembles which are subensembles of conventional irregular LDPC code ensembles and develop density evolution for those ensembles. Further, we find an ensemble which has a better threshold than that of its super ensemble.
DOI
10.1109/isit.2003.1228135

Related papers

Sufficient Conditions for a Regular LDPC Code Better than an Irregular LDPC Code

MiyamotoShinya, KasaiKenta, SakaniwaKohichi

Decoding performance of LDPC (Low-Density Parity-Check) codes is highly dependent on the degree distributions of the Tanner graphs which define the LDPC codes. We compare two LDPC code ensembles, o...

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Feb 1, 2007•0 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

Irregular codes from regular graphs

Pascal O. Vontobel, Hans‐Andrea Loeliger

It has been recognized that appropriately chosen irregular low-density parity-check (LDPC) codes have a remarkable performance advantage compared to regular LDPC codes and that their threshold is much better. Starting with regular graphs, we construct codes consisting of more sophisticated subcodes (compared to simple XORs) and show that performance gains can be achieved by optimizing the proportions of the high-degree bit nodes and the different subcodes being used.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2003•5 citations

A family of irregular LDPC codes with low encoding complexity

Sarah J. Johnson, Steven R. Weller

We consider irregular quasi-cyclic low-density parity-check (LDPC) codes derived from difference families. The resulting codes can be encoded with low complexity and perform well when iteratively decoded with the sum-product algorithm.

IEEE Communications Letters•Feb 1, 2003•110 citations

A new family of irregular LDPC Codes

Hong Wen, Fei Hu, Han Li +1 more

In this paper, we present a method for constructing irregular LDPC (low density parity check) codes based on the optical orthogonal codes. The resulting codes are quasi-cyclic codes and can be encoded with low complexity. They perform well with the sum-product iterative decoding.

IEEE Circuits and Systems Symposium on Emerging Technologies•Nov 13, 2004•1 citation

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
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
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.