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

Evaluating zero error noise thresholds by the replica method for Gallager code ensembles

祥介 樺島, Yoshiyuki Kabashima

Published Jan 1, 2002• 0 citations
OpenAlex

Related papers

Evaluating zero error noise thresholds by the replica method for Gallager code ensembles

Yoshiyuki Kabashima, Naoya Sazuka A, K. Nakamura +1 more

The replica method, developed in statistical physics, is employed in conjunction with Gallager's methodology to accurately evaluate zero error noise thresholds for Gallager code ensembles. Our approach generally provides more optimistic evaluations than those reported in the information theory literature for sparse matrices; the difference vanishes as the parity check matrix becomes dense.

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

An Extension of Gallager Ensemble of Low Density Parity Check Codes

Tadashi Wadayama

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•May 1, 2002•4 citations

Tighter decoding reliability bound for Gallager’s error-correcting code

Yoshiyuki Kabashima, Naoya Sazuka A, Kazutaka Nakamura +1 more

Statistical physics is employed to evaluate the performance of error-correcting codes in the case of finite message length for an ensemble of Gallager's error correcting codes. We follow Gallager's approach of upper bounding the average decoding error rate, but invoke the replica method to reproduce the tightest general bound to date, and to improve on the most accurate zero-error noise level threshold reported in the literature. The relation between the methods used and those presented in the information theory literature are explored.

arXiv:cond-mat/0010173•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Sep 21, 2001•28 citations

STATISTICAL MECHANICS APPROACH TO ERROR-CORRECTING CODES

Nicolas Sourlas

Solvay Conference on Physics•Aug 1, 2003•2 citations

Statistical mechanics of error correcting codes

祥介 樺島, Yoshiyuki Kabashima

•Jan 1, 1999•0 citations

Tangential Sphere Bounds on the Ensemble Performance of ML Decoded Gallager Codes via Their Exact Ensemble Distance Spectrum

Sheng Tong

An efficient numerical approach to the exact ensemble distance spectrum of Gallager codes has been developed by evaluating powers of polynomials. With the exact ensemble distance spectrum of Gallager codes, tangential sphere upper bounds on their maximum likelihood (ML) decoding performance over binary input AWGN channels are investigated. Numerical results indicate improved bounds have been obtained, better than Sason and Shamai's results (which are based on Gallager's upper bound on the ensemble distance spectrum), especially in the error floor region. Furthermore, some critical properties of Gallager codes, including typical minimum distance and the performance tradeoff in the waterfall and error floor regions, have been considered.

International Conference on Communications•Jan 1, 2008•8 citations
Statistical physics is employed to evaluate the performance of error-correcting codes in the case of finite message length for an ensemble of Gallager's error correcting codes. We follow Gallager's approach of upper bounding the average decoding error rate, but invoke the replica method to reproduce the tightest general bound to date, and to improve on the most accurate zero-error noise level threshold reported in the literature. The relation between the methods used and those presented in the information theory literature are explored.
An efficient numerical approach to the exact ensemble distance spectrum of Gallager codes has been developed by evaluating powers of polynomials. With the exact ensemble distance spectrum of Gallager codes, tangential sphere upper bounds on their maximum likelihood (ML) decoding performance over binary input AWGN channels are investigated. Numerical results indicate improved bounds have been obtained, better than Sason and Shamai's results (which are based on Gallager's upper bound on the ensemble distance spectrum), especially in the error floor region. Furthermore, some critical properties of Gallager codes, including typical minimum distance and the performance tradeoff in the waterfall and error floor regions, have been considered.