The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach
Abstract
In the late 1950s and early 1960s, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for hard-decision algebraic decoding, such as Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes. This paper shows that finite fields can also be successfully used to construct algebraic low-density parity-check (LDPC) codes for iterative soft-decision decoding. Methods of construction are presented. LDPC codes constructed by these methods are quasi-cyclic (QC) and they perform very well over the additive white Gaussian noise (AWGN), binary random, and burst erasure channels with iterative decoding in terms of bit-error probability, block-error probability, error-floor, and rate of decoding convergence, collectively. Particularly, they have low error floors. Since the codes are QC, they can be encoded using simple shift registers with linear complexity.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
(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
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Error control coding : fundamentals and applications
Lin, S., & Costello, D. J. (1983) · Medical Entomology and Zoology · Cited by 4,296
Self-citationGood 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
Polynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,662
Design of capacity-approaching irregular low-density parity-check codes
Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910578 · Cited by 3,335
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
Near Shannon limit performance of low density paritycheck codes
MacKay, D. J. C., & Neal, R. M. (1997) · Electronics Letters · doi:10.1049/el:19970362 · Cited by 2,678
Near Shannon limit performance of low density paritycheck codes
MacKay, D. J. C., & Neal, R. M. (1996) · Electronics Letters · doi:10.1049/el:19961141 · Cited by 1,923
Regular 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
On a class of error correcting binary group codes
Bose, R. C., & Ray-Chaudhuri, D. K. (1960) · Information and Control · doi:10.1016/s0019-9958(60)90287-4 · Cited by 1,367
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
Self-citationQuasi-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
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
Error Control Coding: Fundamentals and Applications
Darnell, M. (1985) · IEE Proceedings F Communications, Radar and Signal Processing · doi:10.1049/ip-f-1.1985.0011 · Cited by 991
Codes and Decoding on General Graphs
Wiberg, N. (1996) · Cited by 869
Richardson, T. (2003) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 682
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
Self-citationCombinatorial 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
Tang, H., Xu, J., Lin, S., & Abdel-Ghaffar, K. A. S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.840867 · Cited by 176
Self-citationConstruction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
Xu, J., Chen, L., Djurdjevic, I., Lin, S., & Abdel-Ghaffar, K. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.887082 · Cited by 161
Self-citationConstruction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs
Ammar, B., Honary, B., Kou, Y., Xu, J., & Lin, S. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828144 · Cited by 157
Self-citationOn the computation of the minimum distance of low-density parity-check codes
Hu, X.-Y., Fossorier, M. P. C., & Eleftheriou, E. S. (2004) · International Conference on Communications · doi:10.1109/icc.2004.1312605 · Cited by 156
Protograph based LDPC codes with minimum distance linearly growing with block size
Divsalar, D., Jones, C., Dolinar, S. J., & Thorpe, J. (2005) · Globecom · doi:10.1109/glocom.2005.1577834 · Cited by 115
On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes
Tang, H., Xu, J., Kou, Y., Lin, S., & Abdel-Ghaffar, K. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828088 · Cited by 105
Self-citation
Metadata
- Authors
- Lan, L., Zeng, L., Tai, Y. Y., Chen, L., Lin, S., & Abdel-Ghaffar, K.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2007-07
- Volume
- 53
- Issue
- 7
- Pages
- 2429-2458
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2113420173
- Cited by
- 263
- References
- 30
- FWCI
- 32.06
- 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.