Tighter decoding reliability bound for Gallager’s error-correcting code
- 21 September 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 64 (4) , 046113
- https://doi.org/10.1103/physreve.64.046113
Abstract
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.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Turbo codes: the phase transitionZeitschrift für Physik B Condensed Matter, 2000
- The statistical mechanics of turbo codesZeitschrift für Physik B Condensed Matter, 2000
- Statistical physics of regular low-density parity-check error-correcting codesPhysical Review E, 2000
- Typical Performance of Gallager-Type Error-Correcting CodesPhysical Review Letters, 2000
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1997
- Spin Glasses, Error-Correcting Codes and Finite-Temperature DecodingEurophysics Letters, 1994
- Spin-glass models as error-correcting codesNature, 1989
- A simple derivation of the coding theorem and some applicationsIEEE Transactions on Information Theory, 1965
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962