The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Design of capacity-approaching irregular low-density parity-check codes
Open accessAbstract
We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on the work of Richardson and Urbanke (see ibid., vol.47, no.2, p.599-618, 2000). Assuming that the underlying communication channel is symmetric, we prove that the probability densities at the message nodes of the graph possess a certain symmetry. Using this symmetry property we then show that, under the assumption of no cycles, the message densities always converge as the number of iterations tends to infinity. Furthermore, we prove a stability condition which implies an upper bound on the fraction of errors that a belief-propagation decoder can correct when applied to a code induced from a bipartite graph with a given degree distribution. Our codes are found by optimizing the degree structure of the underlying graphs. We develop several strategies to perform this optimization. We also present some simulation results for the codes found which show that the performance of the codes is very close to the asymptotic theoretical bounds.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
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
PE, & Billingsley, P. (1996) · Journal of the American Statistical Association · doi:10.2307/2291440 · Cited by 6,481
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
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
A recursive approach to low complexity codes
Tanner, R. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056404 · Cited by 3,138
The capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
Self-citation
Cited by
Weedbrook, C., Pirandola, S., García-Patrón, R., Cerf, N. J., Ralph, T. C., Shapiro, J. H., & Lloyd, S. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.621 · Cited by 3,664
The capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
Self-citationConvergence behavior of iteratively decoded parallel concatenated codes
ten Brink, S. (2001) · IEEE Transactions on Communications · doi:10.1109/26.957394 · Cited by 2,386
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Wireless Information-Theoretic Security
Bloch, M., Barros, J., Rodrigues, M. R. D., & McLaughlin, S. W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921908 · Cited by 1,847
Expander graphs and their applications
Hoory, S., Linial, N., & Wigderson, A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01126-8 · Cited by 1,723
Marzetta, T. L., Larsson, E. G., Yang, H., & Ngo, H. Q. (2016) · Cambridge University Press eBooks · doi:10.1017/cbo9781316799895 · Cited by 1,718
Outage Capacity Optimization for Free-Space Optical Links With Pointing Errors
Farid, A. A., & Hranilovic, S. (2007) · Journal of Lightwave Technology · doi:10.1109/jlt.2007.899174 · Cited by 1,590
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
Self-citationRegular and irregular progressive edge-growth tanner graphs
Hu, X.-Y., Eleftheriou, E., & Arnold, D. M. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839541 · Cited by 1,485
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
Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
Fossorier, M. P. C. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.831841 · Cited by 1,219
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
Self-citationEfficient 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
Self-citationMacKay, D. J. C. (2005) · IEE Proceedings - Communications · doi:10.1049/ip-com:20050237 · Cited by 899
Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation
Bocherer, G., Steiner, F., & Schulte, P. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2015.2494016 · Cited by 828
Extrinsic information transfer functions: model and erasure channel properties
Ashikhmin, A., Kramer, G., & ten Brink, S. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.836693 · Cited by 756
Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$
Declercq, D., & Fossorier, M. (2007) · IEEE Transactions on Communications · doi:10.1109/tcomm.2007.894088 · Cited by 724
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
Quantum key distribution over25kmwith an all-fiber continuous-variable system
Lodewyck, J., Bloch, M., García-Patrón, R., Fossier, S., Karpov, E., Diamanti, E., Debuisschert, T., Cerf, N. J., Tualle-Brouri, R., McLaughlin, S. W., et al. (2007) · Physical Review A · doi:10.1103/physreva.76.042305 · Cited by 543
Mansour, M. M., & Shanbhag, N. R. (2003) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2003.817545 · Cited by 536
Bayesian Compressive Sensing Via Belief Propagation
Baron, D., Sarvotham, S., & Baraniuk, R. G. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2027773 · Cited by 498
Capacity of MIMO systems with antenna selection
Molisch, A. F., Win, M. Z., Choi, Y.-S., & Winters, J. H. (2005) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2005.850307 · Cited by 487
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
Probabilistic Constellation Shaping for Optical Fiber Communications
Cho, J., & Winzer, P. J. (2019) · Journal of Lightwave Technology · doi:10.1109/jlt.2019.2898855 · Cited by 438
Design of Low-Density Parity Check Codes for 5G New Radio
Richardson, T., & Kudekar, S. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1700839 · Cited by 433
Self-citationFoundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
Jordan, M. I. (2004) · Statistical Science · doi:10.1214/088342304000000026 · Cited by 420
Leverrier, A., & Grangier, P. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.180504 · Cited by 410
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
Selective Avoidance of Cycles in Irregular LDPC Code Construction
Tian, T., Jones, C. R., Villasenor, J. D., & Wesel, R. D. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.833048 · Cited by 395
Liu, Y., Tan, Z., Hu, H., Cimini, L. J., & Li, G. Y. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2320074 · Cited by 394
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
(2006) · Springer eBooks · doi:10.1007/1-4020-4711-8 · Cited by 363
Iterative multiuser joint decoding: unified framework and asymptotic analysis
Boutros, J., & Caire, G. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1013125 · Cited by 314
Hou, J., Siegel, P. H., Milstein, L. B., & Pfister, H. D. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.815777 · Cited by 290
Log-domain decoding of LDPC codes over GF(q)
Wymeersch, H., Steendam, H., & Moeneclaey, M. (2004) · 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577) · doi:10.1109/icc.2004.1312606 · Cited by 287
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 282
Long-distance continuous-variable quantum key distribution with a Gaussian modulation
Jouguet, P., Kunz-Jacques, S., & Leverrier, A. (2011) · Physical Review A · doi:10.1103/physreva.84.062317 · Cited by 275
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels
Bennatan, A., & Burshtein, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862080 · Cited by 267
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
Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
Vasic, B., & Milenkovic, O. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828066 · Cited by 263
Design of repeat-accumulate codes for iterative detection and decoding
ten Brink, S., & Kramer, G. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.818250 · Cited by 258
Joint FEC/CRC coding scheme for energy constrained IOT devices
Ez-zazi, I., Arioua, M., El Oualkadi, A., & el Assari, Y. (2017) · Proceedings of the International Conference on Future Networks and Distributed Systems · doi:10.1145/3102304.3102329 · Cited by 10
Post-quantum cryptography : a study of the decoding of QC-MDPC codes
Vasseur, V. (2026) · doi:10.70675/732852a5z1ca0z491dz8a02z51f0a24611b7 · Cited by 3
Channel Coding for DTTB System
(2015) · Digital Terrestrial Television Broadcasting · doi:10.1002/9781119084365.ch03
Metadata
- Authors
- Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2001
- Volume
- 47
- Issue
- 2
- Pages
- 619-637
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2127490352
- Cited by
- 3,335
- References
- 16
- FWCI
- 169.44
- Type
- journal article
- Language
- en
- Open access
- green
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.