articleTop 10% cited
Near Shannon limit performance of low density paritycheck codes
Electronics Letters · 1996 · Vol. 32(18) · pp. 1645–1646
David Mackay✉(Cavendish Hospital)Radford M. Neal(University of Toronto)
Abstract
The authors report the empirical performance of Gallager's low density parity check codes on Gaussian channels. It is shown 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.
Error Correcting Code TechniquesAdvanced Wireless Communication TechniquesWireless Communication Security TechniquesTurbo codeNoisy-channel coding theoremSerial concatenated convolutional codesConvolutional codeMathematicsConcatenated error correction codeLimit (mathematics)Low-density parity-check codeComputer scienceAlgorithm
Citations
1,888
FWCI
7.18
field-weighted impact
References
6
Percentile
97%
vs. same field & year
Citations per year
Cited by
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
IEEE Journal on Selected Areas in Communications · 1998 · 907 citations
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory · 1999 · 3,695 citations
References
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory · 1999 · 3,695 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.