Near Shannon limit performancd of low density parity check codes

David J. C. MacKay, Cavendish Laboratory, Cambridge University
Radford M. Neal, Dept. of Statistics and Dept. of Computer Science, University of Toronto

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.

Electronics Letters, vol. 32, pp. 1645-1646. Reprinted with printing errors corrected in vol. 33, pp. 457-458.