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 Transactions on Fundamentals of Electronics Communications and Computer Sciences

An Extension of Gallager Ensemble of Low Density Parity Check Codes

Tadashi Wadayama

Published May 1, 2002• 4 citations
OpenAlex

Related papers

Two approaches to the analysis of low-density parity-check codes

Kamil Sh. Zigangirov, Michael Lentmaier, Dmitri V. Truhachev

We overview two approaches to the analysis of low-density parity-check (LDPC) codes: selected code approach and ensemble approach. As examples of application of the methods we consider Gallager's homogeneous LDPC codes and Berrou-Glavieux-Thitimajshima (BGT) turbo-codes.

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

A construction of low-density parity-check codes

李铁楠, 单秀玲

•Jan 1, 2013•2 citations

A NEW FAMILY OF LOW-DENSITY PARITY CHECK CODES WITH LARGE GIRTH AND LOW COMPLEXITY

Xu Xia, Yanping Li, Moon Ho Lee

한국통신학회 학술대회 및 강연회•Apr 1, 2004•0 citations

Chained Gallager codes

Victor Zyablov, Florian Hug, Rolf Johannesson

The ensemble of regular Low-Density Parity-Check (LDPC) codes introduced by Gallager is considered. Using probabilistic arguments a lower bound on the normalized minimum distance is derived. A new code construction, called Chained Gallager codes, is introduced as the combination of two Gallager codes and its error correcting capabilities are studied.

•Jan 1, 2009•1 citation

Average Coset Weight Distributions of Gallager's LDPC Code Ensemble

Tadashi Wadayama

In this correspondence, the average coset weight distributions of Gallager's low-density parity-check (LDPC) code ensemble are investigated. Gallager's LDPC code ensemble consists of regular mtimesn-LDPC matrices with column weight j and row weight k. The average coset weight distribution can be derived by enumerating the number of parity-check matrices in the ensemble satisfying certain conditions. Based on combinatorial arguments, a formula for the average coset weight distribution will be proved. From the formula, we can show some properties of the average coset weight distributions such as equivalence classes of syndromes, symmetry of the distributions, and a lower bound on coset weight

IEEE Transactions on Information Theory•Jun 28, 2005•5 citations

A NEW CONSTRUCTION METHOD FOR LOW-DENSITY PARITY-CHECK CODES

Mahmoud Rashidpour, Javad Haghighat, Jamali S.H.R. +1 more

•Jan 1, 2003•0 citations
In this correspondence, the average coset weight distributions of Gallager's low-density parity-check (LDPC) code ensemble are investigated. Gallager's LDPC code ensemble consists of regular mtimesn-LDPC matrices with column weight j and row weight k. The average coset weight distribution can be derived by enumerating the number of parity-check matrices in the ensemble satisfying certain conditions. Based on combinatorial arguments, a formula for the average coset weight distribution will be proved. From the formula, we can show some properties of the average coset weight distributions such as equivalence classes of syndromes, symmetry of the distributions, and a lower bound on coset weight