DMCA
Good Error-Correcting Codes based on Very Sparse Matrices (1999)
Cached
Download Links
- [www.ima.umn.edu]
- [www.mathe2.uni-bayreuth.de]
- [wol.ra.phy.cam.ac.uk]
- [www.inference.phy.cam.ac.uk]
- [www.cs.toronto.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 737 - 23 self |
BibTeX
@MISC{MacKay99gooderror-correcting,
author = {David J.C. MacKay},
title = {Good Error-Correcting Codes based on Very Sparse Matrices},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay--Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The decoding of both codes can be tackled with a practical sum-product algorithm. We prove that these codes are "very good," in that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit. This result holds not only for the binary-symmetric channel but also for any channel with symmetric stationary ergodic noise. We give experimental results for binary-symmetric channels and Gaussian channels demonstrating that practical performance substantially better than that of standard convolutional and concatenated codes can be achieved; indeed, the performance of Gallager codes is almost as close to the Shannon limit as that of turbo codes.
Keyphrases
sparse matrix good error-correcting code binary-symmetric channel shannon limit gallager code symmetric stationary ergodic noise practical sum-product algorithm mackay neal excellent property turbo code gaussian channel error-correcting code practical performance standard convolutional experimental result achieve information rate
