Near Shannon Limit Performance of Low Density Parity Check Codes (1996)
by
David J.C. MacKay
,
Radford M. Neal
| Venue: | Electronics Letters |
| Citations: | 205 - 23 self |
BibTeX
@ARTICLE{MacKay96nearshannon,
author = {David J.C. MacKay and Radford M. Neal},
title = {Near Shannon Limit Performance of Low Density Parity Check Codes},
journal = {Electronics Letters},
year = {1996},
volume = {32},
pages = {1645--1646}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We report the empirical performance of Gallager's low density parity check codes on Gaussian channels. We 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.
Citations
| 5665 | Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference - Pearl - 1988 |
| 979 | Near Shannon limit error-correcting coding and decoding - Berrou, Glavieux, et al. - 1993 |
| 349 | Good error correcting codes based on very sparse matrices - MacKay - 1999 |
| 279 | Low density parity check codes - Gallager |
| 142 | Concatenated Codes - Forney - 1966 |
| 64 | Good codes based on very sparse matrices - MacKay, Neal - 1995 |
| 47 | Multiple turbo codes - Divsalar, Pollara - 1995 |
| 25 | Low Density Parity Check Codes. Number 21 in MIT Research monograph series - Gallager - 1963 |
| 4 | We can think of good codes, and even decode them - Battail - 1993 |
