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

Springer eBooks

Geometric Constructions of Gallager Codes

Shu Lin, Jun Xu, Heng Tang, Yu Kou

Published Jan 1, 2003• 0 citations
Publisher
DOI
10.1007/978-1-4757-3789-9_9

Related papers

A Class of Improved Low-Density Parity-Check Codes Constructed Based on Gallager's Form

Guangen Wu, Pinyi Ren

Focused on the problem that short cycles degrade the iterative decoding performance of finite length LDPC, a class of improved low density parity check (LDPC) codes constructed based on Gallager's form is designed. On the basis of keeping down the basic form of Gallager's construction, a quasi-cyclic form is used, then the new codes are free of cycles of length 4 and have good minimum distance. Simulation results demonstrated that the improved codes are better than Gallager's codes when block length is small

International Conference on Communications, Circuits and Systems•Jun 1, 2006•0 citations

Geometric constructions of quantum codes

Jürgen Bierbrauer, D. Bartoli, Stefano Marcugini +1 more

Contemporary mathematics - American Mathematical Society•Jan 1, 2010•5 citations

Performance of turbo-Gallager codes over additive white Gaussian channel

K. M. S. Soyjaudah, Pierre Clarel Catherine

A highly-performing code called turbo-Gallager code (TG code) is introduced, which outperforms the normal Gallager code of same rate. The decoding of the TG code is based on the construction of the contradiction matrix and is capable of correcting errors left over by normal Gallager code decoders.

Electronics Letters•Sep 26, 2002•1 citation

One-generator quasi-cyclic codes and their dual codes

Kanat Abdukhalikov, Tushar Bag, Daniel Panario

Discrete Mathematics•Feb 15, 2023•14 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

The Metric Structure of Linear Codes

Diego Ruano

Springer eBooks•Jan 1, 2018•5 citations
Focused on the problem that short cycles degrade the iterative decoding performance of finite length LDPC, a class of improved low density parity check (LDPC) codes constructed based on Gallager's form is designed. On the basis of keeping down the basic form of Gallager's construction, a quasi-cyclic form is used, then the new codes are free of cycles of length 4 and have good minimum distance. Simulation results demonstrated that the improved codes are better than Gallager's codes when block length is small