Error-Correcting Codes That Nearly Saturate Shannon's Bound
- 27 September 1999
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 83 (13) , 2660-2663
- https://doi.org/10.1103/physrevlett.83.2660
Abstract
Gallager-type error-correcting codes that nearly saturate Shannon's bound are constructed using insight gained from mapping the problem onto that of an Ising spin system. The performance of the suggested codes is evaluated for different code rates for both finite and infinite message lengths.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Elements of Information TheoryPublished by Wiley ,2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Statistical mechanics of error-correcting codesEurophysics Letters, 1999
- Near optimum error correcting coding and decoding: turbo-codesIEEE Transactions on Communications, 1996
- Spin-glass models as error-correcting codesNature, 1989
- Asymmetric neural networks with multispin interactionsPhysical Review A, 1988
- Mean-field theory of spin-glasses with finite coordination numberPhysical Review Letters, 1987
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948