The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Near Shannon limit performance of low density paritycheck codes
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1988) · Cited by 16,582
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Berrou, C., Glavieux, A., & Thitimajshima, P. (2002) · Proceedings of ICC '93 - IEEE International Conference on Communications · doi:10.1109/icc.1993.397441 · Cited by 6,738
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Near Shannon limit error-correcting coding and decoding : Turbo-codes
Berrou, C. (1993) · International Conference on Communications · Cited by 4,264
Good error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
Self-citation(1988) · doi:10.1016/b978-0-08-051489-5.50008-4 · Cited by 1,429
Good codes based on very sparse matrices
MacKay, D. J. C., & Neal, R. M. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60693-9_13 · Cited by 451
Self-citation
Cited by
Good error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
Self-citationBit-interleaved coded modulation
Caire, G., Taricco, G., & Biglieri, E. (2002) · Proceedings of IEEE International Symposium on Information Theory · doi:10.1109/isit.1997.613011 · Cited by 1,927
LTE – The UMTS Long Term Evolution: From Theory to Practice
(2009) · Wiley eBooks · doi:10.1002/9780470742891 · Cited by 1,816
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
Chung, S.-Y., Forney, G. D., Richardson, T. J., & Urbanke, R. (2001) · IEEE Communications Letters · doi:10.1109/4234.905935 · Cited by 1,539
Low-density parity-check codes based on finite geometries: a rediscovery and new results
Kou, Y., Lin, S., & Fossorier, M. P. C. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959255 · Cited by 1,302
Low-density parity check codes over GF(q)
Davey, M. C., & MacKay, D. (1998) · IEEE Communications Letters · doi:10.1109/4234.681360 · Cited by 1,199
Self-citationStatistical Physics of Spin Glasses and Information Processing: An Introduction
Nishimori, H. (2001) · doi:10.1093/acprof:oso/9780198509417.001.0001 · Cited by 1,182
Efficient erasure correcting codes
Luby, M. G., Mitzenmacher, M., Shokrollahi, M. A., & Spielman, D. A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910575 · Cited by 1,180
Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
Fossorier, M. P. C., Mihaljevic, M., & Imai, H. (1999) · IEEE Transactions on Communications · doi:10.1109/26.768759 · Cited by 1,041
Efficient encoding of low-density parity-check codes
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910579 · Cited by 1,028
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
McEliece, R. J., MacKay, D. J. C., & Cheng, J.-F. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661103 · Cited by 904
Self-citationFifty Years of MIMO Detection: The Road to Large-Scale MIMOs
Yang, S., & Hanzo, L. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2475242 · Cited by 814
The generalized distributive law
Aji, S. M., & McEliece, R. J. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825794 · Cited by 735
Near optimum universal belief propagation based decoding of low-density parity check codes
Chen, J., & Fossorier, M. P. C. (2002) · IEEE Transactions on Communications · doi:10.1109/26.990903 · Cited by 661
Codes on graphs: normal realizations
Forney, G. D. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910573 · Cited by 642
Cellular, Wide-Area, and Non-Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G
Vaezi, M., Azari, A., Khosravirad, S. R., Shirvanimoghaddam, M., Azari, M. M., Chasaki, D., & Popovski, P. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3151028 · Cited by 631
Modulation and coding for linear Gaussian channels
Forney, G. D., & Ungerboeck, G. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720542 · Cited by 597
Survey of Stochastic Computing
Alaghi, A., & Hayes, J. P. (2013) · ACM Transactions on Embedded Computing Systems · doi:10.1145/2465787.2465794 · Cited by 591
Efficient encoding of quasi-cyclic low-density parity-check codes
Li, Z., Chen, L., Zeng, L., Lin, S., & Fong, W. H. (2006) · IEEE Transactions on Communications · doi:10.1109/tcomm.2005.861667 · Cited by 463
Channel coding: The road to channel capacity
Costello, D. J., & Forney, G. D. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.895188 · Cited by 408
Iterative decoding of compound codes by probability propagation in graphical models
Kschischang, F. R., & Frey, B. J. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661110 · Cited by 388
DVB-S2: The Second Generation Standard for Satellite Broad-Band Services
Morello, A., & Mignone, V. (2006) · Proceedings of the IEEE · doi:10.1109/jproc.2005.861013 · Cited by 380
The Art of Error Correcting Coding
Morelos‐Zaragoza, R. H. (2002) · Wiley eBooks · doi:10.1002/0470847824 · Cited by 376
Sparse-Graph Codes for Quantum Error Correction
MacKay, D. J. C., Mitchison, G., & McFadden, P. L. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834737 · Cited by 376
Self-citationSpatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
Kudekar, S., Richardson, T., & Urbanke, R. L. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2280915 · Cited by 360
Error Characterization, Mitigation, and Recovery in Flash-Memory-Based Solid-State Drives
Cai, Y., Ghose, S., Haratsch, E. F., Luo, Y., & Mutlu, O. (2017) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2713127 · Cited by 343
A CDMA multiuser detection algorithm on the basis of belief propagation
Kabashima, Y. (2003) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/36/43/030 · Cited by 324
Accurate, Fully-Automated NMR Spectral Profiling for Metabolomics
Ravanbakhsh, S., Liu, P., Bjordahl, T. C., Mandal, R., Grant, J. R., Wilson, M., Eisner, R., Sinelnikov, I., Hu, X., Luchinat, C., et al. (2015) · PLOS ONE · doi:10.1371/journal.pone.0124219 · Cited by 302
Lan, L., Zeng, L., Tai, Y. Y., Chen, L., Lin, S., & Abdel-Ghaffar, K. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.899516 · Cited by 263
Decoding across the quantum low-density parity-check code landscape
Roffe, J., White, D. R., Burton, S., & Campbell, E. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043423 · Cited by 192
An Artificial Chromosome for Data Storage
Chen, W., Han, M., Zhou, J., Ge, Q., Wang, P., Zhang, X., Zhu, S., Song, L., & Yuan, Y. (2021) · National Science Review · doi:10.1093/nsr/nwab028 · Cited by 136
LEARN Codes: Inventing Low-Latency Codes via Recurrent Neural Networks
Jiang, Y., Kim, H., Asnani, H., Kannan, S., Oh, S., & Viswanath, P. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.2988577 · Cited by 87
Improved read/write cost tradeoff in DNA-based data storage using LDPC codes
Chandak, S., Tatwawadi, K., Lau, B., Mardia, J., Kubit, M., Neu, J., Griffin, P., Wootters, M., Weissman, T., & Ji, H. (2019) · 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2019.8919890 · Cited by 80
Data storage using peptide sequences
Ng, C. C. A., Tam, W. M., Yin, H., Wu, Q., So, P.-K., Wong, M. Y.-M., Lau, F. C. M., & Yao, Z.-P. (2021) · Nature Communications · doi:10.1038/s41467-021-24496-9 · Cited by 41
Localized statistics decoding for quantum low-density parity-check codes
Hillmann, T., Berent, L., Quintavalle, A. O., Eisert, J., Wille, R., & Roffe, J. (2025) · Nature Communications · doi:10.1038/s41467-025-63214-7 · Cited by 37
Metadata
- Authors
- MacKay, D. J. C., & Neal, R. M.
- Venue
- Electronics Letters
- Published
- 1997-03-13
- Volume
- 33
- Issue
- 6
- Pages
- 457-458
- ISSN
- 0013-5194 (ISSN-L)
- 1350-911X
- OpenAlex
- W2156938362
- Cited by
- 2,678
- References
- 8
- FWCI
- 22.84
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.