Near Shannon limit performance of low density paritycheck codes
- 13 March 1997
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 33 (6) , 457-458
- https://doi.org/10.1049/el:19970362
Abstract
The authors report the empirical performance of Gallager's low density parity check codes on Gaussian channels. They show that performance substantially better than that of standard convolutional and concatenated codes can be achieved; indeed the performance is almost as close to the Shannon limit as that of turbo codes.Keywords
This publication has 4 references indexed in Scilit:
- Good codes based on very sparse matricesPublished by Springer Nature ,1995
- Basic Concepts in Information Theory and CodingPublished by Springer Nature ,1994
- BAYESIAN INFERENCEPublished by Elsevier ,1988
- Low-Density Parity-Check CodesPublished by MIT Press ,1963